Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
By Yevgeniy Dodis, Rafail M. Ostrovsky, Leonid Reyzin, Adam D. Smith. 2004
3,285 citations recorded by the source corpus.
We provide formal definitions and efficient secure techniques for turning biometric information into keys usable for any cryptographic application, and reliably and securely authenticating biometric data.
Subfields: Computer Vision and Pattern Recognition, Information Systems, Signal Processing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Anil K. Jain
- Karthik Nandakumar
- Brent Waters
- Andreas Uhl
- Christian Rathgeb
- Roel Maes
- Amit Sahai
- Dan Boneh
In Information Systems
- Brent Waters
- Anil K. Jain
- Karthik Nandakumar
- Xavier Boyen
- Amit Sahai
- Dan Boneh
- Christian Rathgeb
- Andreas Uhl
In Signal Processing
- Anil K. Jain
- Karthik Nandakumar
- Roel Maes
- Christian Rathgeb
- Andreas Uhl
- Sharath Pankanti
- Abhishek Nagar
- Nalini K. Ratha
Citations in the corpus
- On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy (2010, methodology): “Unlike most applications of fuzzy extractors (see, in particular, [13, 14]), in this proof we are not interested in hiding partial information about the source, in our case the approximate utility vectors w′ revealed by the San mechanism, so we don’t care how much min-entropy is used up in generatin”
- 50 years of biometric research: Accomplishments, challenges, and opportunities (2016, neutral): “…2006 [85] , which could capture iris images at a 3 m standoff distance and from subjects Please cite this article as: A.K. Jain et al., 50 years of biometric research: Accomplishments, challenges, and opportunities, Pattern Recognition Letters (2016), http://dx.doi.org/10.1016/j.patrec.2015.12.013”
- Correcting errors without leaking partial information (2005, methodology): “Fuzzy extractors were introduced in [11] to cope with keys derived from biometrics and other noisy measurements.”
- Fingerprint-Based Fuzzy Vault: Implementation and Performance (2007, background): “Therefore, fuzzy constructions that do not involve chaff points could be considered.”
- A Robust ECC-Based Provable Secure Authentication Protocol With Privacy Preserving for Industrial Internet of Things (2018, methodology): “From [26], a fuzzy extractor is a useful tool, which retrieves the biometric information as a fixed length string.”
- Efficient Helper Data Key Extractor on FPGAs (2008, methodology): “Other constructions as well as constructions for other metrics can be found in [11].”
- Physical Unclonable Functions and Applications: A Tutorial (2014, background): “Clearly, the implemented PUF has the desired properties.”
- Information-Theoretically Secret Key Generation for Fading Wireless Channels (2009, background): “This can be implemented by linear mapping and universal hashing [11], [16], [45], [57], or by an extractor [22], [24], [25], [45], [52].”
- Design and Analysis of Secure Lightweight Remote User Authentication and Key Agreement Scheme in Internet of Drones Deployment (2019, background): “AQ6: Please confirm the volume number for Reference [21].”
- Public-Key Cryptosystems Resilient to Key Leakage (2009, background): “[9] formalized the notion of average min-entropy that captures the remaining unpredictability of a random variable X conditioned on the value of a random variable Y , formally defined as follows:”
- Robust key generation from signal envelopes in wireless networks (2007, methodology): “We recall that a fuzzy extractor [14] is similar to a randomness extractor but it has a built-in error-correcting capability: any value of an imperfect random source that belongs to a sphere of a certain fixed radius for a given metric can be repaired to the same identical randomness extraction (giv”
- Generating Cancelable Fingerprint Templates (2007, background): “Further details may be found in [7], [10], [11], [13], [28], [29].”
- Leftover Hashing Against Quantum Side Information (2010, methodology): “The notion we use is sometimes called average conditional min-entropy [15].”
- A Secure Biometrics-Based Multi-Server Authentication Protocol Using Smart Cards (2015, background): “A metric space is a set ϒ with a distance function dis : ϒ × ϒ → R + = [ 0 , ∞ ) [34].”
- Lightweight and Privacy-Preserving Two-Factor Authentication Scheme for IoT Devices (2019, methodology): “Rec operations, we adopted the code offset mechanisms using BCH [21].”
- CacheAudit: A Tool for the Static Analysis of Cache Side Channels (2013, background): “Likewise the negative logarithm of (2) is the conditional minentropy H(X|C) of X given C (see [Dodis et al. 2008; Smith 2009] for definitions), i.”
- Aegis: A Single-Chip Secure Processor (2007, background): “A paper on fuzzy extractors [31] provide a solution for this case.”