Description
Smooth hash proof systems have been introduced by Cramer and shoup to build compact efficient cca2 encryption in the standard model. Since then, they found applications in a broad range of protocols from oblivious transfer to authenticated key exchange, passing by witness examples.<br/> In this talk, we will start by a panorama of languages that can be managed by such a primitive and then show how this is enough to instantiate efficiently various primitives. We will provide examples of such constructions first with vanilla cryptography (elliptic curve, paillier) but also show that post-quantum constructions can be achieved with a non-prohibitive efficiency in both lattice and code based cryptography, widening the range of primitive available under those hypotheses.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=722446***1670&autojoin
Next sessions
-
Séminaire C2 à INRIA Paris
Emmanuel Thomé et Pierrick Gaudry Rachelle Heim Boissier Épiphane Nouetowa Dung Bui Plus d'infos sur https://seminaire-c2.inria.fr/ -
Attacking the Supersingular Isogeny Problem: From the Delfs–Galbraith algorithm to oriented graphs
Speaker : Arthur Herlédan Le Merdy - COSIC, KU Leuven
The threat of quantum computers motivates the introduction of new hard problems for cryptography.One promising candidate is the Isogeny problem: given two elliptic curves, compute a “nice’’ map between them, called an isogeny.In this talk, we study classical attacks on this problem, specialised to supersingular elliptic curves, on which the security of current isogeny-based cryptography relies. In[…]-
Cryptography
-