This page has only limited features, please log in for full access.

Unclaimed
Fanfan Zheng
Department of Communication Engineering, Xiamen University, Xiamen 361005, China

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 14 July 2015 in Entropy
Reads 0
Downloads 0

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.

ACS Style

Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. Identity Authentication over Noisy Channels. Entropy 2015, 17, 4940 -4958.

AMA Style

Fanfan Zheng, Zhiqing Xiao, Shidong Zhou, Jing Wang, Lianfen Huang. Identity Authentication over Noisy Channels. Entropy. 2015; 17 (12):4940-4958.

Chicago/Turabian Style

Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. 2015. "Identity Authentication over Noisy Channels." Entropy 17, no. 12: 4940-4958.

Journal article
Published: 14 January 2015 in Entropy
Reads 0
Downloads 0

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.

ACS Style

Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. Message Authentication over Noisy Channels. Entropy 2015, 17, 368 -383.

AMA Style

Fanfan Zheng, Zhiqing Xiao, Shidong Zhou, Jing Wang, Lianfen Huang. Message Authentication over Noisy Channels. Entropy. 2015; 17 (1):368-383.

Chicago/Turabian Style

Fanfan Zheng; Zhiqing Xiao; Shidong Zhou; Jing Wang; Lianfen Huang. 2015. "Message Authentication over Noisy Channels." Entropy 17, no. 1: 368-383.