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.
670 résultats
-
-
Séminaire
-
Cryptographie
Short McEliece key from algebraic geometry codes with automorphism
Orateur : elise barelli - INRIA Saclay
In 1978, McEliece introduced a public key encryption scheme based on linear codes and suggested to use classical Goppa codes, ie: subfield subcodes of algebraic geometric (AG) codes built on a curve of genus 0. This proposition remains secure and in order to have a generalization of classical Goppa codes, in 1996, H. Janwa and O. Moreno suggested to use subfield subcode of AG codes, which we call[…] -
-
-
Séminaire
-
Cryptographie
Complete Addition Formulas for Prime Order Elliptic Curves
Orateur : Joost Renes - University of Nijmegen
An elliptic curve addition law is said to be complete if it correctly computes the sum of any two points in the elliptic curve group. One of the main reasons for the increased popularity of Edwards curves in the ECC community is that they can allow a complete group law that is also relatively efficient (e.g., when compared to all known addition laws on Edwards curves). Such complete addition[…] -
-
-
Séminaire
-
Cryptographie
Locally recoverable codes from curves
Orateur : Everett Howe - Center for Communications Research, San Diego
A locally recoverable code, or LRC, is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. I will explain why LRCs are important for applications such as cloud data storage, and I will present several constructions of locally recoverable codes from Galois covers of curves over finite[…] -
-
-
Séminaire
-
Cryptographie
Gröbner Bases Techniques in Post-Quantum Cryptography
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Sanitization of FHE Ciphertexts
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Multilinear Maps from Obfuscation
Orateur : 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[…] -