Structured Coding for Authentication in the Presence of a Malicious Adversary

Authentication in the presence of a malicious adversary consists of either recovering the legitimate transmission or declaring that the adversary has interfered with the transmission. In this work, we present a structured coding scheme for keyless authentication over a discrete memoryless binary-input, symmetric adversarial channel. Our scheme allows for coding rates up to the non-adversarial capacity of the underlying channel, as well as bounded-complexity decoding.

[1]  H. O. Foulkes.  Abstract Algebra , 1967, Nature.

[2]  Venkatesan Guruswami,et al.  Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

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

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

[6]  Mayank Bakshi,et al.  Arbitrarily varying networks: Capacity-achieving computationally efficient codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

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

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

[10]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

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