Secret key authentication capacity region, Part II: typical 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 second of a two part study, with the studies separated by how the authentication rate is measured. Here, the authentication rate is measured by the minimum of the maximum probability of false acceptance where the minimization is over all highly probable subsets of observations at the adversary. That is, consider the maximum probability of false authentication as a function of the adversary's observation, and the adversary's observation as a random variable. The authentication rate is then measured as the smallest number for which the probability that the maximum probability of false authentication is greater than said number is arbitrary small. This is termed typical authentication, since it only needs to consider adversarial observations which are typical with the transmission. Under this measure of authentication matching inner and outer bounds are determined.

[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]  Eric Graves,et al.  Keyless authentication in the presence of a simultaneously transmitting adversary , 2016, 2016 IEEE Information Theory Workshop (ITW).

[4]  Eric Graves,et al.  Inducing Information Stability to Obtain Information Theoretic Necessary Requirements , 2020, IEEE Transactions on Information Theory.

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

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

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

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

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

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

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

[12]  W. Rudin Principles of mathematical analysis , 1964 .

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

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

[15]  Oliver Kosut,et al.  Authentication Against a Myopic Adversary , 2019, 2019 IEEE Conference on Communications and Network Security (CNS).

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

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

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

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

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

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

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