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.
761 résultats
-
-
Séminaire
-
Cryptographie
co-organisée avec le séminaire sécurité des systèmes électroniques embarqués
Orateur : mot de passe: 344005 - très classe le mot de passe en clair !
https://seminaires-dga.inria.fr/securite-elec/<br/> lien: https://bbb.irisa.fr/b/ger-mvp-9xd -
-
-
Séminaire
-
Cryptographie
Soutenance de thèse: Conception de courbes elliptiques et applications
Orateur : Rémi Clarisse - Rennes
Le thème de la sécurité de l’information est prédominant dans nos vies actuelles. En particulier, les utilisateurs de service, plus précisément en ligne, s’attendent de plus en plus à ce que leurs données à caractère personnel soient traitées dignement et avec leur consentement. Cela incite donc à concevoir des systèmes se pliant à de telles exigences. Le recours à la cryptographie permet de[…] -
-
-
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
On the hardness of the NTRU problem
Orateur : Alice Pellet-Mary - CNRS, Institut Mathématiques de Bordeaux
The NTRU problem is an algorithmic problem over structured lattices that was introduced by Hoffstein, Pipher, and Silverman more than 20 years ago, and which has been used to construct various cryptographic primitives. However, its relation to other lattice problems is still not well understood.<br/> In this talk, we will describe different variants of the NTRU problem, and study how they compare[…] -
-
-
Séminaire
-
Cryptographie
Traceable Constant-Size Multi-Authority Credentials
Orateur : Chloé Hébant - ENS
Many attribute-based anonymous credential (ABC) schemes have been proposed allowing a user to prove the possession of some attributes, anonymously. They became more and more practical with, for the most recent papers, a constant-size credential to show a subset of attributes issued by a unique credential issuer. However, proving possession of attributes coming from K different credential issuers[…] -
-
-
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[…] -