Message Authentication over Noisy Channels

Self Cite

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.

Section: Alicementioning

confidence: 99%

Section: Alicementioning

confidence: 99%

See 1 more Smart Citation

Identity Authentication over Noisy Channels

Zheng

Xiao

Zhou

et al. 2015

Self Cite

“…This problem, also referred to as the problem of output approximation, provides a powerful tool to analyze the fundamental limits of various problems in information theory and information security. Some such examples include identification codes [11][12][13], distributed hypothesis testing [14], message authentication [15], secret key generation [16], and coding for secure communication [17][18][19]. We consider two types of problems in which either a general source (mean-channel resolvability) or a VL uniform random number (VL channel resolvability) is used as a coin distribution.…”

Section: Introductionmentioning

confidence: 99%

Variable-Length Resolvability for General Sources and Channels

Yagi,

Han

2023

We introduce the problem of variable-length (VL) source resolvability, in which a given target probability distribution is approximated by encoding a VL uniform random number, and the asymptotically minimum average length rate of the uniform random number, called the VL resolvability, is investigated. We first analyze the VL resolvability with the variational distance as an approximation measure. Next, we investigate the case under the divergence as an approximation measure. When the asymptotically exact approximation is required, it is shown that the resolvability under two kinds of approximation measures coincides. We then extend the analysis to the case of channel resolvability, where the target distribution is the output distribution via a general channel due to a fixed general source as an input. The obtained characterization of channel resolvability is fully general in the sense that, when the channel is just an identity mapping, it reduces to general formulas for source resolvability. We also analyze the second-order VL resolvability.

“…In the next paper [9], entitled "Message Authentication over Noisy Channels", Fanfan Zheng, et al reformulate the authentication problems in "Authentication over noisy channels" in IEEE Trans. Inf.…”

mentioning

confidence: 99%

Special Issue on Entropy-Based Applied Cryptography and Enhanced Security for Ubiquitous Computing

Park

Zhou

2016

Entropy is a basic and important concept in information theory. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubiquitous computing (Ubi-comp) has emerged rapidly as an exciting new paradigm. In this special issue, we mainly selected and discussed papers related with ore theories based on the graph theory to solve computational problems on cryptography and security, practical technologies; applications and services for Ubi-comp including secure encryption techniques, identity and authentication; credential cloning attacks and countermeasures; switching generator with resistance against the algebraic and side channel attacks; entropy-based network anomaly detection; applied cryptography using chaos function, information hiding and watermark, secret sharing, message authentication, detection and modeling of cyber attacks with Petri Nets, and quantum flows for secret key distribution, etc.Keywords: applied cryptography; enhanced security; ubiquitous computing Entropy is a basic and important concept in information theory introduced by Claude E. Shannon. It is also often used as a measure of the unpredictability of a cryptographic key in cryptography research areas. Ubi-comp has emerged rapidly as an exciting new paradigm. Together with these trends, applied cryptography and security have become rising big issues for providing secure and trusted computing in the next generation of information and communications. A detailed discussion of these issues includes applied cryptography and security concerns that cover amongst others, confidentiality, integrity, and availability including various application areas. In particular, these topics will comprehensively focus on the important aspects of entropy-based applied cryptography and enhanced security for Ubi-comp. Topics in Ubi-comp include entropy-based applied cryptographic aspects, entropy-based hash functions, mathematical and algorithmic foundations of applied cryptography, advanced design and analysis of cryptographic algorithms, authentication and access control, privacy protection and trust computing, entropy-based network security issues, information hiding and digital forensics, security issues in cloud computing and mobile social networks. This special issue aims to provide advanced theories and applications. Furthermore, researchers contribute with original research and review articles that present state-of-the-art research outcomes, practical results in entropy-based applied cryptographic models, and enhanced security system for Ubi-comp.During our working period, we received a total of 33 submissions from at least 10 countries where the corresponding authors were majorly counted by the deadline for paper submission. All these submissions were found with significant contributions in main interested topics of our special issue. However, only 14 high quality papers were accepted after two or three-round strict and rigorous review processes. These accepted papers mainly look at our issu...