Description
We consider properties of Boolean functions which are important when they are used as components in cryptographic primitives. We focus mainly on non-linearity. Closely related issues are the weight distribution of BCH codes with two zeros and the crosscorrelation of two m-sequences. We shall present some recently solved old problems and the methods which where required to achieve this breakthrough. Finally we shall give a perspective for further research and focus on some still open questions.
Prochains exposés
-
Oblivious Transfer from Zero-Knowledge Proofs (or how to achieve round-optimal quantum Oblivious Transfer without structure)
Orateur : Léo Colisson - Université Grenoble Alpes
We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable oblivious transfer (OT) protocol (the protocol itself involving quantum interactions), mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions…) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely[…]-
Cryptography
-