Description
Most of todays cryptography relies on the assumption that a potential attacker cannot solve some computational problem (e.g. factor a large integer). It has been shown in the early 80's that with the use of quantum-mechanical effects, certain cryptographic tasks can be done unconditionally, i.e., secure against computationally unbounded attackers: Quantum-cryptography, and with it the hope that (m)any cryptographic task(s) can be solved this way, was born. This hope was smashed in the late 90's, when it was shown that any non-trivial cryptographic task involving two mutually distrusted parties cannot be done unconditionally by means of quantum-cryptography.<br/> We propose a new approach to circumvent this impossibility result. We construct quantum-cryptographic schemes which are secure under the sole assumption that the attacker's quantum memory is limited. This is motivated by the fact that storing even a single qubit for more than a fraction of a second seems to be out of reach with today's technology. This approach allows for practical schemes for Oblivious Transfer and for Bit Commitment.<br/> (Joint work with Ivan Damgård, Louis Salvail and Christian Schaffner)
Next sessions
-
SoK: Security of the Ascon Modes
Speaker : Charlotte Lefevre - Radboud University
The Ascon authenticated encryption scheme and hash function of Dobraunig et al (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack[…] -
Comprehensive Modelling of Power Noise via Gaussian Processes with Applications to True Random Number Generators
Speaker : Maciej Skorski - Laboratoire Hubert Curien
The talk examines power noise modelling through Gaussian Processes for secure True Random Number Generators. While revisiting one-sided fractional Brownian motion, we obtain novel contributions by quantifying posterior uncertainty in exact analytical form, establishing quasi-stationary properties, and developing rigorous time-frequency analysis. These results are applied to model oscillator[…]-
Cryptography
-
TRNG
-
-
CryptoVerif: a computationally-sound security protocol verifier
Speaker : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-