Description
QKD is a landmark of how quantum resources allow us to implement cryptographic
functionalities with a level of security that is not achievable only with classical resources.
However, key agreement is not sufficient to implement all functionalities of interest, and it is
well-known that they cannot be implemented with perfect security, even if we have access
to quantum resources. Thus, computational assumptions are necessary even in the quantum
world.
In this talk, I will cover recent examples that even in the computational setting, quantum
resources may give an advantage in the required assumption. More concretely, I will talk
about quantum implementations of multi-party computation and public-key encryption
under weaker computational assumptions than their classical counterparts. Moreover, I will
discuss new cryptographic assumptions that are inherently quantum, which have changed
the landscape of the feasibility of cryptographic primitives in the quantum world.
Practical infos
Next sessions
-
Lightweight (AND, XOR) Implementations of Large-Degree S-boxes
Speaker : Marie Bolzer - LORIA
The problem of finding a minimal circuit to implement a given function is one of the oldest in electronics. In cryptography, the focus is on small functions, especially on S-boxes which are classically the only non-linear functions in iterated block ciphers. In this work, we propose new ad-hoc automatic tools to look for lightweight implementations of non-linear functions on up to 5 variables for[…]-
Cryptography
-
Symmetrical primitive
-
Implementation of cryptographic algorithm
-
-
Algorithms for post-quantum commutative group actions
Speaker : Marc Houben - Inria Bordeaux
At the historical foundation of isogeny-based cryptography lies a scheme known as CRS; a key exchange protocol based on class group actions on elliptic curves. Along with more efficient variants, such as CSIDH, this framework has emerged as a powerful building block for the construction of advanced post-quantum cryptographic primitives. Unfortunately, all protocols in this line of work are[…] -
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-