This page has only limited features, please log in for full access.
Identity authentication is the process of verifying users’ validity. Unlike classical key-based authentications, which are built on noiseless channels, this paper introduces a general analysis and design framework for identity authentication over noisy channels. Specifically, the authentication scenarios of single time and multiple times are investigated. For each scenario, the lower bound on the opponent’s success probability is derived, and it is smaller than the classical identity authentication’s. In addition, it can remain the same, even if the secret key is reused. Remarkably, the Cartesian authentication code proves to be helpful for hiding the secret key to maximize the secrecy performance. Finally, we show a potential application of this authentication technique.
Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. Identity Authentication over Noisy Channels. Entropy 2015, 17, 4940 -4958.
AMA StyleFanfan Zheng, Zhiqing Xiao, Shidong Zhou, Jing Wang, Lianfen Huang. Identity Authentication over Noisy Channels. Entropy. 2015; 17 (12):4940-4958.
Chicago/Turabian StyleFanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. 2015. "Identity Authentication over Noisy Channels." Entropy 17, no. 12: 4940-4958.
The essence of authentication is the transmission of unique and irreproducible information. In this paper, the authentication becomes a problem of the secure transmission of the secret key over noisy channels. A general analysis and design framework for message authentication is presented based on the results of Wyner’s wiretap channel. Impersonation and substitution attacks are primarily investigated. Information-theoretic lower and upper bounds on the opponent’s success probability are derived, and the lower bound and the upper bound are shown to match. In general, the fundamental limits on message authentication over noisy channels are fully characterized. Analysis results demonstrate that introducing noisy channels is a reliable way to enhance the security of authentication.
Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. Message Authentication over Noisy Channels. Entropy 2015, 17, 368 -383.
AMA StyleFanfan Zheng, Zhiqing Xiao, Shidong Zhou, Jing Wang, Lianfen Huang. Message Authentication over Noisy Channels. Entropy. 2015; 17 (1):368-383.
Chicago/Turabian StyleFanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. 2015. "Message Authentication over Noisy Channels." Entropy 17, no. 1: 368-383.