Authentication Over Noisy Channels
Authors:
- Lifeng LaiLLLifeng Lai
- Hesham El GamalHGHesham El Gamal
- H. Vincent PoorH. Vincent Poor
- 6 February 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (2) , 906-916
Abstract
An authentication counterpart of Wyner's study of the wiretap channel is developed in this work. More specifically, message authentication over noisy channels is studied while impersonation and substitution attacks are investigated for both single- and multiple-message scenarios. For each scenario, information-theoretic lower and upper bounds on the opponent's success, or cheating, probability are derived. Remarkably, in both scenarios, the lower and upper bounds are shown to match, and hence, the fundamental limits on message authentication over noisy channels are fully characterized. The opponent's success probability is further shown to be smaller than that derived in the classical noiseless channel model. These results rely on a novel authentication scheme in which shared key information is used to provide simultaneous protection against both types of attacks. Finally, message authentication for the case in which the source and receiver possess only correlated sequences is studied.Keywords
This publication has 23 references indexed in Scilit:
- Secure Transmission With Multiple Antennas I: The MISOME Wiretap ChannelIEEE Transactions on Information Theory, 2010
- The Relay–Eavesdropper Channel: Cooperation for SecrecyIEEE Transactions on Information Theory, 2008
- The secrecy capacity of the MIMO wiretap channel2008
- Introduction to the Special Issue on Information Theoretic SecurityIEEE Transactions on Information Theory, 2008
- The CRC–NTMAC for Noisy Message AuthenticationIEEE Transactions on Information Forensics and Security, 2006
- The NTMAC for Authentication of Noisy MessagesIEEE Transactions on Information Forensics and Security, 2006
- Elements of Information Theory2001
- Authentication theory and hypothesis testingIEEE Transactions on Information Theory, 2000
- Lower bounds on the probability of deception in authentication with arbitrationIEEE Transactions on Information Theory, 1994
- Strengthening Simmons' bound on impersonationIEEE Transactions on Information Theory, 1991