Algebraic feature extraction of image for recognition
Pattern Recognition
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Cryptographic Key Generation from Voice
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Reusable cryptographic fuzzy extractors
Proceedings of the 11th ACM conference on Computer and communications security
A secure biometric authentication scheme based on robust hashing
MM&Sec '05 Proceedings of the 7th workshop on Multimedia and security
Information-theoretic key agreement: from weak to strong secrecy for free
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
New shielding functions to enhance privacy and prevent misuse of biometric templates
AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Practical biometric authentication with template protection
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
Secure remote authentication using biometric data
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hiding secret points amidst chaff
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
The best of both worlds: Applying secure sketches to cancelable biometrics
Science of Computer Programming
Embedding Renewable Cryptographic Keys into Continuous Noisy Data
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
The practical subtleties of biometric key generation
SS'08 Proceedings of the 17th conference on Security symposium
IEEE Transactions on Information Forensics and Security
An alignment-free fingerprint cryptosystem based on fuzzy vault scheme
Journal of Network and Computer Applications
Improving the accuracy and storage cost in biometric remote authentication schemes
Journal of Network and Computer Applications
Key extraction from general nondiscrete signals
IEEE Transactions on Information Forensics and Security
A key binding system based on n-nearest minutiae structure of fingerprint
Pattern Recognition Letters
An effective biometric cryptosystem combining fingerprints with error correction codes
Expert Systems with Applications: An International Journal
BioID: biometric-based identity management
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
A quantitative analysis of indistinguishability for a continuous domain biometric cryptosystem
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Generic constructions of biometric identity based encryption systems
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
Biometric Security from an Information-Theoretical Perspective
Foundations and Trends in Communications and Information Theory
Security notions of biometric remote authentication revisited
STM'11 Proceedings of the 7th international conference on Security and Trust Management
Security analysis of key binding biometric cryptosystems
ICISP'12 Proceedings of the 5th international conference on Image and Signal Processing
| Hi-index | 0.00 |
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a sketch. It is desirable that the sketch reveals little information about the biometric templates even in the worst case (i.e., the entropy loss should be low). The main difficulty is that many biometric templates are represented as points in continuous domains with unknown distributions, whereas known results either work only in discrete domains, or lack rigorous analysis on the entropy loss. A general approach to handle points in continuous domains is to quantize (discretize) the points and apply a known sketch scheme in the discrete domain. However, it can be difficult to analyze the entropy loss due to quantization and to find the “optimal” quantizer. In this paper, instead of trying to solve these problems directly, we propose to examine the relative entropy loss of any given scheme, which bounds the number of additional bits we could have extracted if we used the optimal parameters. We give a general scheme and show that the relative entropy loss due to suboptimal discretization is at most (nlog3), where n is the number of points, and the bound is tight. We further illustrate how our scheme can be applied to real biometric data by giving a concrete scheme for face biometrics.