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
-
Verification of Rust Cryptographic Implementations with Aeneas
Speaker : Aymeric Fromherz - Inria
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…] -
On the average hardness of SIVP for module lattices of fixed rank
Speaker : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
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
-