Privacy, Secrecy, and Storage With Multiple Noisy Measurements of Identifiers

The key-leakage-storage region is derived for a generalization of a classic two-terminal key agreement model. The additions to the model are that the encoder observes a hidden, or noisy, version of the identifier, and that the encoder and decoder can perform multiple measurements. To illustrate the behavior of the region, the theory is applied to binary identifiers and noise modeled via binary symmetric channels. In particular, the key-leakage-storage region is simplified by applying Mrs. Gerber’s lemma twice in different directions to a Markov chain. The growth in the region as the number of measurements increases is quantified. The amount by which the privacy-leakage rate reduces for a hidden identifier as compared to a noise-free (visible) identifier at the encoder is also given. If the encoder incorrectly models the source as visible, it is shown that substantial secrecy leakage may occur and the reliability of the reconstructed key might decrease.

[1]  Blaise L. P. Gassend,et al.  Physical random functions , 2003 .

[2]  Matthieu R. Bloch,et al.  Physical Layer Security , 2020, Encyclopedia of Wireless Networks.

[3]  Giuseppe Caire,et al.  Secret Key-Based Identification and Authentication With a Privacy Constraint , 2016, IEEE Transactions on Information Theory.

[4]  Anil K. Jain,et al.  Biometric Systems: Technology, Design and Performance Evaluation , 2004 .

[5]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[6]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[7]  Jorge Guajardo,et al.  FPGA Intrinsic PUFs and Their Use for IP Protection , 2007, CHES.

[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]  Hans S. Witsenhausen,et al.  Entropy inequalities for discrete channels , 1974, IEEE Trans. Inf. Theory.

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

[11]  Suela Kodra.  Fuzzy extractors : How to generate strong keys from biometrics and other noisy data , 2015 .

[12]  Maciej Skorski,et al.  Privacy and secrecy with multiple measurements of physical and biometric identifiers , 2015, 2015 IEEE Conference on Communications and Network Security (CNS).

[13]  Hirosuke Yamamoto,et al.  Coding theorems for biometric systems , 2010, 2010 IEEE International Symposium on Information Theory.

[14]  Suhas N. Diggavi,et al.  Secret-Key Generation Using Correlated Sources and Channels , 2009, IEEE Transactions on Information Theory.

[15]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[16]  Hidetoshi Onodera.  Variability: Modeling and Its Impact on Design , 2006, IEICE Trans. Electron..

[17]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[18]  R. Plamondon.  The handwritten signature as a biometric identifier: psychophysical model and system design , 1995 .

[19]  Rudolf Ahlswede,et al.  On the connection between the entropies of input and output distributions of discrete memoryless channels , 1977 .

[20]  Tobias J. Oechtering,et al.  Secure source coding with action-dependent side information , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[21]  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.

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

[23]  Remi A. Chou,et al.  Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation , 2012, IEEE Transactions on Information Theory.

[24]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[25]  Ahmad-Reza Sadeghi,et al.  Reconfigurable Physical Unclonable Functions - Enabling technology for tamper-resistant storage , 2009, 2009 IEEE International Workshop on Hardware-Oriented Security and Trust.

[26]  I. Csiszár,et al.  Common randomness and secret key generation with a helper , 1997, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[27]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[28]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[29]  Vinod M. Prabhakaran,et al.  Secrecy via Sources and Channels , 2008, IEEE Transactions on Information Theory.

[30]  Onur Günlü,et al.  DCT based ring oscillator Physical Unclonable Functions , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[31]  Haim H. Permuter,et al.  Source Coding With a Side Information “Vending Machine” , 2009, IEEE Transactions on Information Theory.

[32]  Maximilian Hofer,et al.  Physical Unclonable Functions in Theory and Practice , 2012 .

[33]  Stephen A. Benton,et al.  Physical one-way functions , 2001 .

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

[35]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[36]  Stark C. Draper,et al.  A Theoretical Analysis of Authentication, Privacy, and Reusability Across Secure Biometric Systems , 2011, IEEE Transactions on Information Forensics and Security.

[37]  Johannes B. Huber,et al.  Bounds on information combining , 2005, IEEE Transactions on Information Theory.

[38]  Shlomo Shamai,et al.  Extension of an entropy property for binary input memoryless symmetric channels , 1989, IEEE Trans. Inf. Theory.

[39]  Onur Günlü,et al.  Reliable secret key generation from physical unclonable functions under varying environmental conditions , 2015, 2015 IEEE International Workshop on Information Forensics and Security (WIFS).

[40]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.