The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Open accessAbstract
We provide formal definitions and efficient secure techniques for turning noisy information into keys usable for any cryptographic application, and, in particular, 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 primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its 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 a cryptographic application. A secure sketch produces public information about its 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. We define the primitives to be both formally secure and versatile, generalizing much prior work. In addition, we provide nearly optimal constructions of both primitives for various measures of “closeness” of input data, such as Hamming distance, edit distance, and set difference.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
(1961) · Journal of the Optical Society of America · doi:10.1364/josa.51.000248 · Cited by 2,288
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
Self-citationSecret key agreement by public discussion from common information
Maurer, U. M. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256484 · Cited by 2,005
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,617
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
Generalized privacy amplification
Bennett, C. H., Brassard, G., Crepeau, C., & Maurer, U. M. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.476316 · Cited by 1,417
Cited by
Jain, A. K., Nandakumar, K., & Nagar, A. (2008) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/2008/579416 · Cited by 1,134
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
50 years of biometric research: Accomplishments, challenges, and opportunities
Jain, A. K., Nandakumar, K., & Ross, A. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2015.12.013 · Cited by 708
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
PUF Modeling Attacks on Simulated and Silicon Data
Ruhrmair, U., Solter, J., Sehnke, F., Xu, X., Mahmoud, A., Stoyanova, V., Dror, G., Schmidhuber, J., Burleson, W., & Devadas, S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2279798 · Cited by 637
On the Foundations of Quantitative Information Flow
Smith, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00596-1_21 · Cited by 570
Fingerprint-Based Fuzzy Vault: Implementation and Performance
Nandakumar, K., Jain, A. K., & Pankanti, S. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.908165 · Cited by 553
Physically Unclonable Functions: A Study on the State of the Art and Future Research Directions
Maes, R., & Verbauwhede, I. (2010) · Information Security and Cryptography · doi:10.1007/978-3-642-14452-3_1 · Cited by 469
Key Generation From Wireless Channels: A Review
Zhang, J., Duong, T. Q., Marshall, A., & Woods, R. (2016) · IEEE Access · doi:10.1109/access.2016.2521718 · Cited by 451
Read-Proof Hardware from Protective Coatings
Tuyls, P., Schrijen, G.-J., Škorić, B., van Geloven, J., Verhaegh, N., & Wolters, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_29 · Cited by 421
Information-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
Li, X., Niu, J., Bhuiyan, M. Z. A., Wu, F., Karuppiah, M., & Kumari, S. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2773666 · Cited by 414
A Secure Biometrics-Based Multi-Server Authentication Protocol Using Smart Cards
Odelu, V., Das, A. K., & Goswami, A. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2439964 · Cited by 413
Public-Key Cryptosystems Resilient to Key Leakage
Naor, M., & Segev, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_2 · Cited by 403
Lightweight and Privacy-Preserving Two-Factor Authentication Scheme for IoT Devices
Gope, P., & Sikdar, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2846299 · Cited by 378
Biometric Template Protection: Bridging the performance gap between theory and practice
Nandakumar, K., & Jain, A. K. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2427849 · Cited by 322
Authentication Protocols for Internet of Things: A Comprehensive Survey
Ferrag, M. A., Maglaras, L. A., Janicke, H., Jiang, J., & Shu, L. (2017) · Security and Communication Networks · doi:10.1155/2017/6562953 · Cited by 318
Cracking Fuzzy Vaults and Biometric Encryption
Scheirer, W. J., & Boult, T. E. (2007) · 2007 Biometrics Symposium · doi:10.1109/bcc.2007.4430534 · Cited by 309
Leftover Hashing Against Quantum Side Information
Tomamichel, M., Schaffner, C., Smith, A., & Renner, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158473 · Cited by 303
Self-citationMultibiometric Cryptosystems Based on Feature-Level Fusion
Nagar, A., Nandakumar, K., & Jain, A. K. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2166545 · Cited by 286
Secret key generation exploiting channel characteristics in wireless communications
Ren, K., Su, H., & Wang, Q. (2011) · IEEE Wireless Communications · doi:10.1109/mwc.2011.5999759 · Cited by 262
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Cramer, R., Dodis, Y., Fehr, S., Padró, C., & Wichs, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_27 · Cited by 259
Self-citationBiometric template transformation: a security analysis
Nagar, A., Nandakumar, K., & Jain, A. K. (2010) · SPIE Proceedings · doi:10.1117/12.839976 · Cited by 167
Metadata
- Authors
- Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A.
- Venue
- SIAM Journal on Computing
- Published
- 2008-01
- Volume
- 38
- Issue
- 1
- Pages
- 97-139
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2146813141
- Cited by
- 1,717
- References
- 44
- FWCI
- 144.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.