False-Accept/False-Reject Trade-Offs for Ensembles of Biometric Authentication Systems

Biometric authentication systems, based on secret key generation, work as follows. In the enrollment stage, an individual provides a biometric signal that is mapped into a secret key and a helper message, the former being prepared to become available to the system at a later time (for authentication), and the latter is stored in a public database. When an authorized user requests authentication, claiming his/her identity to be one of those of the subscribers, he/she has to provide a biometric signal again, and then the system, which retrieves also the helper message of the claimed subscriber, produces an estimate of the secret key that is finally compared to the secret key of the claimed user. In the case of a match, the authentication request is approved; otherwise, it is rejected. Evidently, there is an inherent tension between two desired, but conflicting, properties of the helper message encoder; on the one hand, the encoding should be informative enough concerning the identity of the real subscriber, in order to approve him/her in the authentication stage, but on the other hand, it should not be too informative, as otherwise, unauthorized imposters could easily fool the system and gain access. A good encoder should then trade off the two kinds of errors: the false reject (FR) error and the false accept (FA) error. In this paper, we investigate trade-offs between the random coding FR error exponent and the best achievable FA error exponent. We compare two types of ensembles of codes: fixed-rate codes and variable-rate codes, and we show that the latter class of codes offers considerable improvement compared to the former. In doing this, we characterize ensemble-optimal rate functions for both types of codes. We also examine the effect of privacy leakage constraints for both fixed-rate codes and variable-rate codes

[1]  Neri Merhav Ensemble Performance of Biometric Authentication Systems Based on Secret Key Generation , 2019, IEEE Trans. Inf. Theory.

[2]  Jun Chen,et al.  On the Reliability Function of Variable-Rate Slepian-Wolf Coding , 2017, Entropy.

[3]  Neri Merhav,et al.  Optimum Tradeoffs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian–Wolf Coding , 2015, IEEE Transactions on Information Theory.

[4]  H. Vincent Poor,et al.  The Likelihood Encoder for Lossy Compression , 2014, IEEE Transactions on Information Theory.

[5]  Frans M. J. Willems,et al.  Biometric Security from an Information-Theoretical Perspective , 2012, Found. Trends Commun. Inf. Theory.

[6]  Masahide Sasaki,et al.  Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint , 2013, IEEE Transactions on Information Theory.

[7]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[8]  H.V. Poor,et al.  Privacy-security tradeoffs in biometric security systems , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[9]  Neri Merhav The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds , 2017, IEEE Trans. Inf. Theory.

[10]  Frans M. J. Willems,et al.  Authentication based on secret-key generation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Neri Merhav,et al.  A large deviations approach to secure lossy compression , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Vincent Y. F. Tan,et al.  The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents , 2011, IEEE Transactions on Information Theory.

[13]  Albert Guillén i Fàbregas,et al.  The likelihood decoder: Error exponents and mismatch , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[15]  M. Maurer,et al.  Secret Key Agreement by Public Discussion from Common Information , 2004 .

[16]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[17]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.