Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
655 results
-
-
Seminar
-
Cryptography
Gröbner Bases Techniques in Post-Quantum Cryptography
Speaker : Ludovic Perret - LIP6
After the publication of Shor's algorithm, it became evident the most popular public-key cryptographic systems that rely on the integer factorization problem or on the discrete logarithm problem would be easily solvable using large enough quantum computers (if such quantum computers are ever built). That triggered a vivid interest in the research of cryptographic algorithms (mostly public-key[…] -
-
-
Seminar
-
Cryptography
Sanitization of FHE Ciphertexts
Speaker : Damien Stehlé - ENS Lyon
By definition, fully homomorphic encryption (FHE) schemes support homomorphic decryption, and all known FHE constructions are bootstrapped from a Somewhat Homomorphic Encryption (SHE) scheme via this technique. Additionally, when a public key is provided, ciphertexts are also re-randomizable, e.g. by adding to them fresh encryptions of~$0$. From those two operations we devise an algorithm to[…] -
-
-
Seminar
-
Cryptography
Multilinear Maps from Obfuscation
Speaker : Pooya Farshim - ENS Paris
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction.<br/> We provide two distinct, but closely related constructions and show that multilinear analogues of the[…] -
-
-
Seminar
-
Cryptography
Journée de rentrée
Speaker : Géométrie et Algèbre Effectives - IRMAR
Divers exposés. -
-
-
Seminar
-
Cryptography
Vers une mise en œuvre pratique du chiffrement homomorphe
Speaker : Renaud Sirdey - CEA LIST
Nous présentons des travaux d'implémentation du chiffrement (fully) homomorphe et de développement d'outils logiciels supports (compilateurs) permettant de faire le lien entre des algorithmes applicatifs et ce formalisme bas-niveau, de manière aussi performante que possible. L'exposé portera également sur les problématiques d'intégration du chiffrement homomorphe dans des cas d'applications[…] -
-
-
Seminar
-
Cryptography
Simplified Settings for Discrete Logarithms in Small Characteristic Finite Fields
Speaker : Cécile Pierrot - UPMC LIP6
Public key cryptography is based on hard problems, such as the discrete logarithm problem (DLP). In this talk, I focus on the discrete logarithm problem in finite fields:<br/> Given GF(q^k) and a generator g of GF(q^k)*, we say that we solve the DLP in GF(q^k) if, for any arbitrary element h in GF(q^k)*, we are able to recover an integer x such that: g^x = h. When the characteristic is small[…] -