6 research outputs found
Authentication over Noisy Channels
In this work, message authentication over noisy channels is studied. The
model developed in this paper is the authentication theory counterpart of
Wyner's wiretap channel model. Two types of opponent attacks, namely
impersonation attacks and substitution attacks, are investigated for both
single message and multiple message authentication scenarios. For each
scenario, information theoretic lower and upper bounds on the opponent's
success probability are derived. Remarkably, in both scenarios, lower and upper
bounds are shown to match, and hence the fundamental limit of message
authentication over noisy channels is fully characterized. The opponent's
success probability is further shown to be smaller than that derived in the
classic authentication model in which the channel is assumed to be noiseless.
These results rely on a proposed novel authentication scheme in which key
information is used to provide simultaneous protection again both types of
attacks.Comment: Appeared in the Proceedings of the 45th Annual Allerton Conference on
Communication, Control and Computing, Monticello, IL, September 26 - 28, 200
Special issue on entropy-based applied cryptography and enhanced security for ubiquitous computing
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
Byzantine Multiple Access Channels -- Part II: Communication With Adversary Identification
We introduce the problem of determining the identity of a byzantine user
(internal adversary) in a communication system. We consider a two-user discrete
memoryless multiple access channel where either user may deviate from the
prescribed behaviour. Owing to the noisy nature of the channel, it may be
overly restrictive to attempt to detect all deviations. In our formulation, we
only require detecting deviations which impede the decoding of the
non-deviating user's message. When neither user deviates, correct decoding is
required. When one user deviates, the decoder must either output a pair of
messages of which the message of the non-deviating user is correct or identify
the deviating user. The users and the receiver do not share any randomness. The
results include a characterization of the set of channels where communication
is feasible, and an inner and outer bound on the capacity region. We also show
that whenever the rate region has non-empty interior, the capacity region is
same as the capacity region under randomized encoding, where each user shares
independent randomness with the receiver. We also give an outer bound for this
randomized coding capacity region.Comment: arXiv admin note: substantial text overlap with arXiv:2105.0338
Message Authentication over Noisy Channels
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