Table of contents

  • This session has been presented March 16, 2007.

Description

  • Speaker

    Julien Bringer - Sagem

This work deals with the security problems in authentication schemes employing volatile biometric features, where the authentication is indeed a comparison between a fresh feature and that enrolled during the initialization phase. We propose a security model for biometric-based authentication schemes by assuming that the biometric features to be public. Extra attentions have been paid to the privacy issues related to the sensitive relation between a biometric feature and the relevant identity. To formally study the security issues in biometric information comparison, we introduce a new cryptographic primitive, i.e., Decisional Private Information Retrieval (DPIR), inspired by the concept of Private Information Retrieval (PIR). DPIR protocols enable a client to obtain some information about an item from a database without retrieving this item directly. One DPIR protocol is constructed using Paillier's public key encryption scheme and the ElGamal scheme. Finally, we present an authentication scheme based on this DPIR protocol, proved secure in our security model.<br/> Cet exposé est basé sur des travaux communs avec Hervé Chabanne (Sagem Défense Sécurité), Malika Izabachéne, David Pointcheval, Qiang Tang, et Sébastien Zimmer (ENS).

Next sessions

  • Key Attack on the ACDGV Matrix Encryption Scheme

    • September 25, 2026 (13:45 - 14:45)

    • Batiment 32A salle 15

    Speaker : Anmoal Porwal - Technical University of Munich

    I will present our key-recovery attack on the ACDGV public-key encryption scheme proposed at ASIACRYPT 2024 by Aragon, Couvreur, Dyseryn, Gaborit, and Vinçotte. The secret key is a Gabidulin code hidden by appending random rows and columns and by left- and right-multiplication with invertible matrices. Our attack exploits the resulting algebraic structure to recover an equivalent secret key. It[…]
    • Cryptography

    • Asymmetric primitive

  • Module Learning With Errors and Structured Extrapolated Dihedral Cosets

    • October 02, 2026 (13:45 - 14:45)

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

    Speaker : 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

Show previous sessions