Authentication Over Noisy Channels

Authentication Over Noisy Channels
复制标题

DOI:
10.1109/tit.2008.2009842
复制
发表时间:
2008-02
影响因子:
2.5
通讯作者:
L. Lai;Hesham El Gamal;H. Vincent Poor
L. Lai;Hesham El Gamal;H. Vincent Poor
中科院分区:
计算机科学2区
文献类型:
--
作者:
L. Lai;Hesham El Gamal;H. Vincent Poor

文献摘要

被引文献

相似文献

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.