Code Constructions and Bounds for Identification via Channels

Consider the identification (ID) via channels problem, where a receiver decides whether the transmitted identifier is its identifier, rather than decoding it. This model allows to transmit identifiers whose size scales doubly-exponentially in the blocklength, unlike common transmission codes with exponential scaling. Binary constant-weight codes (CWCs) suffice to achieve the ID capacity. Relating parameters O. Günlü and R. F. Schaefer were supported by the German Federal Ministry of Education and Research (BMBF) within the national initiative for “Post Shannon Communication (NewCom)” under the Grant 16KIS1004. J. Kliewer was supported in part by U.S. National Science Foundation (NSF) under Grants 1815322 and 2107370. V. Sidorenko is on leave from the Institute for Information Transmission Problems, Russian Academy of Science. His work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No: 801434) and by the Institute for Communications Engineering at TU Munich. Parts of this work will be presented at the IEEE International Symposium on Information Theory 2021 in [1]. O. Günlü and R. F. Schaefer are with the Chair of Communications Engineering and Security, University of Siegen, 57076 Siegen, Germany (email:{onur.guenlue, rafael.schaefer}@uni-siegen.de). J. Kliewer is with the Department of Electrical and Computer Engineering, New Jersey Institute of Technology, 07102 Newark, NJ, USA (email: jkliewer@njit.edu) V. Sidorenko is with the Institute for Communications Engineering, TU Munich, 80333 Munich, Germany (email: vladimir.sidorenko@tum.de)

[1]  Onur Günlü,et al.  Zero secrecy leakage for multiple enrollments of physical unclonable functions , 2018 .

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

[3]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[4]  Sergio Verdú,et al.  Explicit construction of optimal constant-weight codes for identification via channels , 1993, IEEE Trans. Inf. Theory.

[5]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.

[6]  Edward L. Titlebaum,et al.  A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks , 1993, IEEE Trans. Commun..

[7]  Holger Boche,et al.  Identification Capacity of Channels With Feedback: Discontinuity Behavior, Super-Activation, and Turing Computability , 2020, IEEE Transactions on Information Theory.

[8]  Hirosuke Yamamoto,et al.  On optimal error exponents in noiseless channel identification , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  A. A. Shaar,et al.  Prime sequences: quasi-optimal sequences for OR channel code division multiplexing , 1983 .

[10]  Oliver Kosut,et al.  Authentication and Partial Message Correction over Adversarial Multiple-Access Channels , 2020, 2020 IEEE Conference on Communications and Network Security (CNS).

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

[12]  Shun Watanabe,et al.  Minimax Converse for Identification via Channels , 2020, IEEE Transactions on Information Theory.

[13]  Richard M. Wilson,et al.  Cyclotomy and difference families in elementary abelian groups , 1972 .

[14]  P. Vijay Kumar,et al.  Optical orthogonal codes-New bounds and an optimal construction , 1990, IEEE Trans. Inf. Theory.

[15]  Rudolf Ahlswede,et al.  Identification via channels , 1989, IEEE Trans. Inf. Theory.

[16]  Holger Boche,et al.  Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity , 2018, IEEE Transactions on Information Forensics and Security.

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

[18]  Selmer M. Johnson,et al.  Upper bounds for constant weight error correcting codes , 1972, Discret. Math..

[19]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[20]  Pierre Moulin,et al.  A framework for the design of good watermark identification codes , 2006, Electronic Imaging.

[21]  Onur Günlü,et al.  An Optimality Summary: Secret Key Agreement with Physical Unclonable Functions , 2020, Entropy.

[22]  Andreas J. Winter.  Identification via Quantum Channels in the Presence of Prior Correlation and Feedback , 2005, Electron. Notes Discret. Math..

[23]  H. Vincent Poor,et al.  An Overview of Information-Theoretic Security and Privacy: Metrics, Limits and Applications , 2021, IEEE Journal on Selected Areas in Information Theory.

[24]  Onur Gunlu,et al.  Multi-Entity and Multi-Enrollment Key Agreement With Correlated Noise , 2020, IEEE Transactions on Information Forensics and Security.

[25]  S. V. Maric,et al.  New family of algebraically designed optical orthogonal codes for use in CDMA fibre-optic networks , 1993 .

[26]  Rudolf Ahlswede,et al.  Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[27]  Vinod M. Prabhakaran,et al.  Multiple Access Channels with Byzantine Users , 2019, 2019 IEEE Information Theory Workshop (ITW).

[28]  Guu-chang Yang,et al.  Optical orthogonal codes with unequal auto- and cross-correlation constraints , 1995, IEEE Trans. Inf. Theory.

[29]  Rudolf Ahlswede,et al.  New directions in the theory of identification via channels , 1995, IEEE Trans. Inf. Theory.

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

[31]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[32]  Yossef Steinberg.  New Converses in the Theory of Identification via Channels , 1998, IEEE Trans. Inf. Theory.

[33]  Kaoru Kurosawa,et al.  Strongly universal hashing and identification codes via channels , 1999, IEEE Trans. Inf. Theory.

[34]  Paul R. Prucnal,et al.  Spread spectrum fiber-optic local area network using optical processing , 1986 .

[35]  Krishnan Eswaran.  Identification via Channels and Constant-Weight Codes , 2005 .

[36]  Christian Deppe,et al.  Performance Analysis of Identification Codes , 2020, Entropy.

[37]  Onur Günlü,et al.  Doubly-Exponential Identification via Channels: Code Constructions and Bounds , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[38]  Fan Chung Graham,et al.  Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.