Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
710 results
-
-
Seminar
-
Cryptography
co-organisée avec le séminaire sécurité des systèmes électroniques embarqués
Speaker : 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 -
-
-
Seminar
-
Cryptography
TBA
Speaker : Louiza Khati - Anssi
TBA lien: https://univ-rennes1-fr.zoom.us/j/97066341266?pwd=RUthOFV5cm1uT0ZCQVh6QUcrb1drQT09 -
-
-
Seminar
-
Cryptography
The Revival of Quadratic Fields Cryptography
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
On the hardness of the NTRU problem
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Towards Non-Interactive Zero-Knowledge from CDH and LWE
Speaker : Geoffroy Couteau - Karlsruher Institut für Technologie (KIT)
We provide a generic construction of non-interactive zero-knowledge (NIZK) schemes. Our construction is a refinement of Dwork and Naor’s (FOCS 2000) implementation of the hidden bits model using verifiable pseudorandom generators (VPRGs). Our refinement simplifies their construction and relaxes the necessary assumptions considerably. As a result of this conceptual improvement, we obtain[…] -
-
-
Seminar
-
Cryptography
Lossy trapdoor primitives, zero-knowledge proofs and applications
Speaker : Chen Qian - soutenance de thèse salle Métivier à l'IRISA, 14h
In this thesis, we study two differentprimitives. Lossy trapdoor functions and zero-knwoledge proof systems.The lossy trapdoor functions (LTFs) arefunction families in which injective functionsand lossy ones are computationally indistin-guishable. Since their introduction, they havebeen found useful in constructing various cryp-tographic primitives. We give in this thesisefficient constructions of[…] -