Using Distributed Source Coding to Secure Fingerprint Biometrics
Stark C. Draper,Ashish Khisti,Emin Martinian,Anthony Vetro,Jonathan S. Yedidia +4 more
- 15 Apr 2007
- Vol. 2, pp 129-132
TL;DR: A method to encode fingerprint biometrics securely for use, e.g., in encryption or access control, and how to validate or reject a candidate biometric probe given the probe and the stored encoded data is described.
read more
Abstract: We describe a method to encode fingerprint biometrics securely for use, e.g., in encryption or access control. The system is secure because the stored data does not suffice to recreate the original fingerprint biometric. Therefore, a breach in database security does not lead to the loss of biometric data. At the same time the stored data suffices to validate a probe fingerprint. Our approach is based on the use of distributed source coding techniques implemented with graph-based codes. We present a statistical model of the relationship between the enrollment biometric and the (noisy) biometric measurement taking during authentication. We describe how to validate or reject a candidate biometric probe given the probe and the stored encoded data. We report the effectiveness of our method as tested on a database consisting of 579 data sets, each containing roughly 15 measurements of a single finger. We thereby demonstrate a working secure biometric system for fingerprints.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Biometric template security
TL;DR: This work presents a high-level categorization of the various vulnerabilities of a biometric system and discusses countermeasures that have been proposed to address these vulnerabilities.
Biometric template security
TL;DR: We present a high-level categorization of the various vulnerabilities of a biometric system and discuss countermeasures that have been proposed to address these vulnerabilities.
Cancelable Biometrics: A review
TL;DR: An overview of various cancelable biometric schemes for biometric template protection is provided and the merits and drawbacks of available cancelableBiometric systems are discussed and promising avenues of research are identified.
421
The secrecy of compressed sensing measurements
Y. Rachlin,Dror Baron +1 more
- 01 Sep 2008
TL;DR: It is demonstrated that compressed sensing-based encryption does not achieve Shannon's definition of perfect secrecy, but can provide a computational guarantee of secrecy.
Biometric Systems: Privacy and Secrecy Aspects
TL;DR: This paper addresses privacy leakage in biometric secrecy systems by investigating four settings in which two terminals observe two correlated sequences and determining the fundamental balance for both unconditional and conditional privacy leakage.
References
Factor graphs and the sum-product algorithm
TL;DR: A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Common randomness in information theory and cryptography. I. Secret sharing
Rudolf Ahlswede,Imre Csiszár +1 more
TL;DR: As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered.
1.6K
A fuzzy vault scheme
Ari Juels,Madhu Sudan +1 more
- 30 Jun 2002
TL;DR: In this article, the authors describe a fuzzy vault construction that allows Alice to place a secret value /spl kappa/ in a secure vault and lock it using an unordered set A of elements from some public universe U. If Bob tries to "unlock" the vault using B, he obtains the secret value if B is close to A, i.e., only if A and B overlap substantially.
1.5K