An outer bound of the capacity region of biometric systems under keys, secrets, and privacy requirements

This paper establishes an outer bound of the capacity region of general biometric systems. The goals of biometric systems considered include person identification and secret binding, while template protection, privacy, and secrecy leakage are security issues addressed. A general model of biometric systems is proposed, in which the use of private keys are also incorporated. The system model captures main aspects of major biometric system designs including biometric cryptosystems, cancelable biometrics, and salt biometric systems. In addition to attacks on the database, information leakage from data links between the sensor module and the database is also considered. A general information theoretic rate outer bound is derived for characterizing and comparing the fundamental capacity, and security risks and benefits of different system designs.

[1]  Joseph A. O'Sullivan,et al.  Pattern Recognition System Design with Linear Encoding for Discrete Patterns , 2007, 2007 IEEE International Symposium on Information Theory.

[2]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[3]  Frans M. J. Willems,et al.  Biometric Systems: Privacy and Secrecy Aspects , 2009, IEEE Transactions on Information Forensics and Security.

[4]  H. Vincent Poor,et al.  Privacy–Security Trade-Offs in Biometric Security Systems—Part I: Single Use Case , 2011, IEEE Transactions on Information Forensics and Security.

[5]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[6]  Natalia A. Schmid,et al.  Performance prediction methodology for biometric systems using a large deviations approach , 2004, IEEE Transactions on Signal Processing.

[7]  Joseph A. O'Sullivan,et al.  Achievable rates for pattern recognition: binary and Gaussian cases , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[8]  Frans M. J. Willems,et al.  Fundamental limits for biometric identification with a database containing protected templates , 2010, 2010 International Symposium On Information Theory & Its Applications.

[9]  Paul F. Syverson,et al.  A taxonomy of replay attacks [cryptographic protocols] , 1994, Proceedings The Computer Security Foundations Workshop VII.

[10]  W. Marsden.  I and J , 2012 .

[11]  Sergey Yekhanin,et al.  Secure Biometrics Via Syndromes , 2005 .

[12]  Anil K. Jain,et al.  Biometric Template Security , 2008, EURASIP J. Adv. Signal Process..

[13]  Martin Wattenberg,et al.  A fuzzy commitment scheme , 1999, CCS '99.

[14]  Natalia A. Schmid,et al.  Thresholding method for dimensionality reduction in recognition systems , 2001, IEEE Trans. Inf. Theory.

[15]  Joseph A. O'SullivanElectronic.  Thresholding Method for Reduction of Dimensionality , 2007 .

[16]  Ertem Tuncel.  Capacity/Storage Tradeoff in High-Dimensional Identification Systems , 2006, ISIT.

[17]  Frans M. J. Willems,et al.  Identification and secret-key binding in binary-symmetric template-protected biometric systems , 2010, 2010 IEEE International Workshop on Information Forensics and Security.

[18]  Madhu Sudan,et al.  A Fuzzy Vault Scheme , 2006, Des. Codes Cryptogr..

[19]  Joseph A. O'Sullivan,et al.  Pattern recognition system design based on LDPC matrices , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[20]  Andy Adler,et al.  Vulnerabilities in Biometric Encryption Systems , 2005, AVBPA.

[21]  Paul Syverson,et al.  A Taxonomy of Replay Attacks , 1994 .

[22]  Imre Csiszár,et al.  Information Theory: A packing lemma and the error exponent in channel coding , 2011 .

[23]  Andreas Uhl,et al.  A survey on biometric cryptosystems and cancelable biometrics , 2011, EURASIP J. Inf. Secur..

[24]  Oleksandr Nikitin.  Information-Theoretic Security for the Masses , 2013, ArXiv.