Nested Tailbiting Convolutional Codes for Secrecy, Privacy, and Storage

The key agreement problem with biometric or physical identifiers and two terminals for key enrollment and reconstruction is considered. A nested convolutional code construction that performs lossy compression with side information is proposed. Nested convolutional codes are an alternative to nested polar codes and nested random linear codes that achieve all points of the key-leakage-storage regions of the generated-secret and chosen-secret models for long block lengths. Our design uses a convolutional code for vector quantization during enrollment and a subcode of it for error correction during reconstruction. Physical identifiers with small bit error probability are considered to illustrate the gains of the proposed construction. One variant of nested convolutional codes improves on all previous constructions in terms of the key vs. storage rate ratio but it has high complexity. Another variant of nested convolutional codes with lower complexity performs similarly to previously designed nested polar codes. The results suggest that the choice of convolutional or polar codes for key agreement with identifiers depends on the complexity constraints.

[1]  Bin Chen,et al.  A Robust SRAM-PUF Key Generation Scheme Based on Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[2]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[3]  Ingrid Verbauwhede,et al.  A soft decision helper data algorithm for SRAM PUFs , 2009, 2009 IEEE International Symposium on Information Theory.

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

[5]  Shu Lin,et al.  Two decoding algorithms for tailbiting codes , 2003, IEEE Trans. Commun..

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

[7]  Victoria Kostina,et al.  Lossy data compression: Nonasymptotic fundamental limits , 2013 .

[8]  Onur Günlü.  Key Agreement with Physical Unclonable Functions and Biometric Identifiers , 2019 .

[9]  H. Vincent Poor,et al.  Secure Nested Codes for Type II Wiretap Channels , 2007, 2007 IEEE Information Theory Workshop.

[10]  Vladimir Sidorenko,et al.  On Maximum-Likelihood Decoding of Time-Varying Trellis Codes , 2019, 2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY).

[11]  Onur Günlü,et al.  Secure and Reliable Key Agreement with Physical Unclonable Functions † , 2018, IACR Cryptol. ePrint Arch..

[12]  Haim H. Permuter,et al.  Coordination Capacity , 2009, IEEE Transactions on Information Theory.

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

[14]  Imre Csiszár,et al.  Common randomness and secret key generation with a helper , 2000, IEEE Trans. Inf. Theory.

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

[16]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

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

[18]  Onur Günlü,et al.  Privacy, Secrecy, and Storage With Multiple Noisy Measurements of Identifiers , 2016, IEEE Transactions on Information Forensics and Security.

[19]  Patrizio Campisi,et al.  Security and Privacy in Biometrics , 2013, Springer London.

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

[21]  Onur Ozan Koyluoglu,et al.  Polar coding for secure transmission and key agreement , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[22]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[23]  Jack K. Wolf,et al.  On the weight distribution of linear block codes formed from convolutional codes , 1996, IEEE Trans. Commun..

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

[25]  Onur Günlü,et al.  Low-Complexity and Reliable Transforms for Physical Unclonable Functions , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[26]  Onur Günlü,et al.  Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems , 2017, IEEE Transactions on Information Forensics and Security.

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

[28]  Alexander Vardy,et al.  Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes , 2010, IEEE Transactions on Information Theory.

[29]  Jörg Kliewer,et al.  Polar coding for empirical and strong coordination via distribution approximation , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[30]  R. Pappu,et al.  Physical One-Way Functions , 2002, Science.

[31]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[33]  Cesarino Bertini,et al.  LOGICS FROM QUANTUM COMPUTATION WITH BOUNDED ADDITIVE OPERATORS , 2012 .

[34]  Mikael Skoglund,et al.  Nested Polar Codes for Wiretap and Relay Channels , 2010, IEEE Communications Letters.

[35]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[36]  L. Palzer,et al.  A converse for lossy source coding in the finite blocklength regime , 2016 .

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

[38]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

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

[40]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding: Johannesson/Fundamentals , 2015 .

[41]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

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

[43]  Boris Skoric,et al.  Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting Method , 2006, 2006 IEEE International Symposium on Information Theory.

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

[45]  Boris Skoric,et al.  Quantum Readout of Physical Unclonable Functions , 2010, AFRICACRYPT.