publication . Article . Preprint . 2008

Authentication Over Noisy Channels

Lifeng Lai; H. El Gamal; H.V. Poor;
Open Access
  • Published: 19 Feb 2008 Journal: IEEE Transactions on Information Theory, volume 55, pages 906-916 (issn: 0018-9448, Copyright policy)
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks and substitution attacks, are investigated for both single message and multiple message authentication scenarios. For each scenario, information theoretic lower and upper bounds on the opponent's success probability are derived. Remarkably, in both scenarios, lower and upper bounds are shown to match, and hence the fundamental limit of message authentication over noisy channels is fully characterized. The opponent's success prob...
Persistent Identifiers
Subjects
arXiv: Computer Science::Cryptography and SecurityComputer Science::MultimediaComputer Science::Information Theory
free text keywords: Library and Information Sciences, Information Systems, Computer Science Applications, Computer Science - Information Theory, Computer Science - Cryptography and Security, Eavesdropping, Upper and lower bounds, Message authentication code, Authentication, Algorithm, Decoding methods, Computer security, computer.software_genre, computer, Information theory, Communication channel, Computer science, Estimation theory
Related Organizations

[1] C. E. Shannon, “Communication theory of secrecy systems,” Bell System Technical Journal, vol. 28, pp. 656-715, Oct. 1949.

[2] A. D. Wyner, “The wire-tap channel,” Bell System Technical Journal, vol. 54, no. 8, pp. 1355-1387, 1975. [OpenAIRE]

[3] I. Csisza´r and J. Ko¨rner, “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory, vol. 24, pp. 339-348, May 1978.

[4] G. J. Simmons, “Authentication theory/coding theory,” in Proceedings of CRYPTO 84 on Advances in Cryptology, (New York, NY, USA), pp. 411-431, Springer-Verlag Inc., 1985.

[5] U. M. Maurer, “Authentication theory and hypothesis testing,” IEEE Trans. on Information Theory, vol. 46, pp. 1350-1356, Jul. 2000.

[6] Y. Liu and C. G. Boncelet, “The CRC-NTMAC for noisy message authentication,” IEEE Transactions on Information Forensics and Security, vol. 1, pp. 517-523, Dec. 2006.

[7] C. G. Boncelet, “The NTMAC for authentication of noisy messages,” IEEE Transactions on Information Forensics and Security, vol. 1, pp. 35-42, Mar. 2006.

[8] C. H. Bennett, G. Brassard, C. Crepeau, and U. M. Maurer, “Generalized privacy amplification,” IEEE Transactions on Information Theory, vol. 41, pp. 1915-1923, Nov. 1995.

[9] U. M. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,” Lecture Notes in Computer Science, vol. 1807, pp. 356-373, 2000.

[10] I. Csisza´r, “Almost independence and secrecy capacity,” Problems of Information Transmission, vol. 32, pp. 40-47, Jan. 1996.

[11] R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography, part II: CR capacity,” IEEE Transactions on Information Theory, vol. 44, pp. 225-240, Jan. 1998. [OpenAIRE]

[12] T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.

[13] U. M. Maurer and S. Wolf, “Secret key agreement over a nonauthenticated channel - Part I: Definitions and bounds,” IEEE Transactions on Information Theory, vol. 49, pp. 822-831, Apr. 2003.

Any information missing or wrong?Report an Issue