Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
727 résultats
-
-
Séminaire
-
Cryptographie
The Revival of Quadratic Fields Cryptography
Orateur : Guilhem Castagnos - Université Bordeaux 1
More than 30 years ago, Buchmann and Williams proposed using ideal class groups of imaginary quadratic fields in cryptography with a Diffie-Hellman style key exchange protocol. After several twists, there has been in recent years a new interest in this area. This rebirth is mainly due to two features. First, class groups of imaginary quadratic fields allow the design of cryptographic protocols[…] -
-
-
Séminaire
-
Cryptographie
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs
Orateur : Thomas Prest - PQShield
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members[…] -
-
-
Séminaire
-
Cryptographie
Implicit proofs of membership
Orateur : Olivier Blazy - Université Limoges
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[…] -
-
-
Séminaire
-
Cryptographie
Toutes les informations ici https://cca.inria.fr/
Orateur : Ilaria Chillotti, Ayoub Otmani, Ida Tucker et Brice Minaud - Séminaire C2
-
-
-
Séminaire
-
Cryptographie
Soutenance de thèse (exceptionnellement mercredi à 13h30 en salle Petri-Turing à l'IRISA): Algorithmes d'algèbre linéaire pour la cryptographie
Orateur : Claire Delaplace - Université Rennes 1
Dans cette thèse, nous discutons d’aspects algorithmiques de trois différents problèmes, en lien avec la cryptographie. La première partie est consacrée à l’algèbre linéaire creuse. Nous y présentons un nouvel algorithme de pivot de Gauss pour matrices creuses à coefficients exacts, ainsi qu’une nouvelle heuristique de selection de pivots, qui rend l’entière procédure particulièrement efficace[…] -
-
-
Séminaire
-
Cryptographie
Wave: A New Code-Based Signature Scheme
Orateur : Thomas Debris-alazard - inria
It is a long standing open problem to build an efficient and secure digital signature scheme based on the hardness of decoding a linear code which could compete with widespread schemes like DSA or RSA. The latter signature schemes are broken by a quantum computer with Shor’s algorithm. Code-based schemes could provide a valid quantum resistant replacement. We present here Wave the first « hash[…] -