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.
644 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
Low-Complexity Cryptographic Hash Functions
Orateur : Vinod Vaikuntanathan - Massachusetts Institute of Technology
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.<br/> Despite[…] -
-
-
Séminaire
-
Cryptographie
Middle-Product Learning With Errors
Orateur : Miruna Rosca - ENS de Lyon
We introduce a new variant MP-LWE of the Learning With Errors problem (LWE) making use of the Middle Product between polynomials modulo an integer q. We exhibit a reduction from the Polynomial-LWE problem (PLWE) parametrized by a polynomial f, to MP-LWE which is defined independently of any such f. The reduction only requires f to be monic with constant coefficient coprime with q. It incurs a noise[…] -
-
-
Séminaire
-
Cryptographie
Coercion-resistant Internet voting made practical
Orateur : Jacques Traore - Orange Labs
Internet voting offers a better voting experience since voters can cast their votes from their computers or even smartphones. By eliminating the need to visit polling places, it may attract more voters and thus increase voter turnout. However, it is still not widely spread owing to many inherent concerns such as risks entailed by the lack of private polling booths. Indeed, this may ease coercion[…] -
-
-
Séminaire
-
Cryptographie
Towards the Implementation of Efficient and Distributable Pairing-based Crypto Library
Orateur : Al-Amin Khandaker - Okayama University
Pairing-based cryptography is popular among the cryptographic protocol researchers for its eccentric provable security. Protocol side researchers often see pairing as a black box. They often need to test the correctness of their proposal. Typically, mathematicians and cryptography engineers try to make the underlying operations of pairing-based crypto efficient. In addition, different types of[…] -
-
-
Séminaire
-
Cryptographie
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Orateur : Alain Passelègue - ENS
Pseudorandom functions (PRFs) are one of the most fundamental primitives in cryptography. In this work, we provide a new algebraic framework which encompasses many of the existing algebraic PRFs, including the ones by Naor and Reingold (FOCS'97), by Lewko and Waters (CCS'09), and by Boneh, Montgomery, and Raghunathan (CCS'10), as well as the related-key-secure PRFs by Bellare and Cash (Crypto'10)[…] -