Authentication and Partial Message Correction over Adversarial Multiple-Access Channels

In this paper, we present results on the authentication capacity region for the two-user arbitrarily-varying multipleaccess channel. We first consider a standard definition of authentication, in which the receiver may discard both messages if an adversary is detected. For this setting, we show that an extension of the arbitrarily-varying channel condition overwritability characterizes the authentication capacity region. We then define γ-correcting authentication, where we require that at least a γ fraction of the users’ messages be correctable, even in the presence of an adversary. We give necessary conditions for the γ-correcting authentication capacity region to have nonempty interior, and show that positive rate pairs are achievable over a particular channel that satisfies these conditions.

[1]  Rick S. Blum,et al.  Secret key authentication capacity region, Part II: typical authentication rate , 2020, ArXiv.

[2]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

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

[4]  Johann-Heinrich Jahn,et al.  Coding of arbitrarily varying multiuser channels , 1981, IEEE Trans. Inf. Theory.

[5]  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).

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

[7]  Vinod M. Prabhakaran,et al.  Multiple Access Channels with Adversarial Users , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[9]  Rudolf Ahlswede,et al.  Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True , 1997, IEEE Trans. Inf. Theory.

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

[11]  John A. Gubner On the deterministic-code capacity of the multiple-access arbitrarily varying channel , 1990, IEEE Trans. Inf. Theory.

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

[13]  Ueli Maurer,et al.  Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion , 1997, EUROCRYPT.

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

[15]  Oliver Kosut,et al.  Structured Coding for Authentication in the Presence of a Malicious Adversary , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[17]  Vinod M. Prabhakaran,et al.  Byzantine Multiple Access , 2019, ArXiv.

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