Description
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
-
Structured-Seed Local Pseudorandom Generators and their Applications
Speaker : Nikolas Melissaris - IRIF
We introduce structured‑seed local pseudorandom generators (SSL-PRGs), pseudorandom generators whose seed is drawn from an efficiently sampleable, structured distribution rather than uniformly. This seemingly modest relaxation turns out to capture many known applications of local PRGs, yet it can be realized from a broader family of hardness assumptions. Our main technical contribution is a[…]-
Cryptography
-
-
Post-Quantum Public-Key Pseudorandom Correlation Functions for OT
Speaker : Mahshid Riahinia - ENS, CNRS
Public-Key Pseudorandom Correlation Functions (PK-PCF) are an exciting recent primitive introduced to enable fast secure computation. Despite significant advances in the group-based setting, success in the post-quantum regime has been much more limited. In this talk, I will introduce an efficient lattice-based PK-PCF for the string OT correlation. At the heart of our result lie several technical[…] -
Predicting Module-Lattice Reduction
Speaker : Paola de Perthuis - CWI
Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as `Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as potentially affecting the concrete security of Kyber and other module-lattice-based schemes. Foundational works on module-lattice reduction (Lee, Pellet-Mary, Stehlé, and Wallet, ASIACRYPT 2019; Mukherjee and Stephens[…]-
Cryptography
-