Sommaire

  • Cet exposé a été présenté le 18 mars 2005.

Description

  • Orateur

    Yevgeniy Dodis - New York Univeristy

We provide formal definitions and efficient secure techniques for - turning biometric and other noisy data into keys usable for *any* cryptographic application, and - reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two new primitives. A *fuzzy extractor* extracts nearly uniform randomness R from its biometric input; the extraction is error-tolerant in the sense that R will be the same even if the input changes, as long as it remains reasonably close to the original. Thus, R can be used as a key in any cryptographic application. A *secure sketch* produces public information about its biometric input w that does not reveal w, and yet allows exact recovery of w given another value that is close to w. Thus, it can be used to reliably reproduce error-prone biometric inputs without incurring the security risk inherent in storing them.<br/> In addition to formally introducing our new primitives, we provide nearly optimal constructions of both primitives for various measures of "closeness" of input data, such as Hamming distance, edit metric, permutation distance and set difference.

Prochains exposés

  • Module Learning With Errors and Structured Extrapolated Dihedral Cosets

    • 02 octobre 2026 (13:45 - 14:45)

    • Batiment 32A salle 8

    Orateur : Jinwei Zheng - Télécom Paris

    The Module Learning With Errors (MLWE) problem is the fundamental hardness assumption underlying the key encapsulation and signature schemes ML-KEM and ML-DSA, which have been selected by NIST for post-quantum cryptography standardization. Understanding its quantum hardness is crucial for assessing the security of these standardized schemes.   Inspired by the equivalence between LWE and[…]
    • Cryptography

  • European Cyber Week: atelier cryptographie post-quantique

    • Du 18 novembre 2026 au 19 novembre 2026 (09:00 - 18:00)

    • Couvent des jacobins, Rennes

    Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…]
  • Journée post-quantique du séminaire cryptographie

    • 20 novembre 2026 (09:00 - 15:00)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Journée scientifique sur la cryptographie post-quantique dans la foulée de l'European Cyber Week avec des exposés plus techniques que ceux de l'ECW. 
Voir les exposés passés