Secret key authentication capacity region, Part I: average authentication rate

This paper investigates the secret key authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's transmission, decides whether or not to replace the destination's observation with an arbitrary one of their choosing (done in hopes of having the destination accept a false message). To combat the adversary, the source and destination share a secret key which they may use to guarantee authenticated communications. The secret key authentication capacity region here is then defined as the region of jointly achievable message rate, authentication rate, and key consumption rate (i.e., how many bits of secret key are needed). This is the first of a two part study, with the parts differing in how the authentication rate is measured. In this first study the authenticated rate is measured by the traditional metric of the maximum expected probability of false authentication. For this metric, we provide an inner bound which improves on those existing in the literature. This is achieved by adopting and merging different classical techniques in novel ways. Within these classical techniques, one technique derives authentication capability directly from the noisy communications channel, and the other technique derives its' authentication capability directly from obscuring the source.

[1]  R. Ahlswede Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[4]  Shaoquan Jiang On the Optimality of Keyless Authentication in a Noisy Model , 2015, IEEE Transactions on Information Forensics and Security.

[5]  Shaoquan Jiang Keyless Authentication in a Noisy Model , 2014, IEEE Transactions on Information Forensics and Security.

[6]  Jörg Kliewer,et al.  Authentication Capacity of Adversarial Channels , 2018, 2018 IEEE Information Theory Workshop (ITW).

[7]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[8]  Larry J. Greenstein,et al.  Using the physical layer for wireless authentication in time-variant channels , 2008, IEEE Transactions on Wireless Communications.

[9]  John S. Baras,et al.  Physical-Layer Authentication , 2008, IEEE Transactions on Information Forensics and Security.

[10]  J. Wolfowitz,et al.  Coding Theorems of Information Theory , 1964, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[11]  Can Emre Koksal,et al.  On the Basic Limits of RF-Fingerprint-Based Authentication , 2016, IEEE Transactions on Information Theory.

[12]  Gustavus J. Simmons,et al.  Authentication Theory/Coding Theory , 1985, CRYPTO.

[13]  Imre Csiszár,et al.  The capacity of the arbitrarily varying channel revisited: Positivity, constraints , 1988, IEEE Trans. Inf. Theory.

[14]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

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

[16]  Jacob Wolfowitz Coding Theorems of Information Theory , 1962 .

[17]  Guillermo Morales-Luna,et al.  Performance Evaluation of Keyless Authentication Based on Noisy Channel , 2007 .

[18]  H. Vincent Poor,et al.  Authentication Over Noisy Channels , 2008, IEEE Transactions on Information Theory.

[19]  Rick S. Blum,et al.  Inner Bound for the Capacity Region of Noisy Channels with an Authentication Requirement , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[20]  Eric Graves,et al.  Keyless authentication in the presence of a simultaneously transmitting adversary , 2016, 2016 IEEE Information Theory Workshop (ITW).