Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations in signal processing, communications and networking

Identification via Discrete Memoryless Wiretap Channels

Rudolf Ahlswede

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1007/978-3-030-65072-8_6

Related papers

The Discrete Memoryless Arbitrarily Varying Wiretap Channel

Janis Nötzel, Moritz Wiese, Holger Boche

Cambridge University Press eBooks•Jun 16, 2017•1 citation

Capacity Bounds for Identification With Effective Secrecy

Johannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash +3 more

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper’s channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.

arXiv:2306.14792•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•12 citations

New directions in the theory of identification via channels

Rudolf Ahlswede, Z. Zhang

Studies two problems in the theory of identification via channels. The first problem concerns the identification via channels with noisy feedback. Whereas for Shannon's transmission problem the capacity of a discrete memoryless channel does not change with feedback, it is known that the identification capacity is affected by feedback. The authors study its dependence on the feedback channel. They prove both, a direct and a converse coding theorem. Although a gap exists between the upper and lower bounds provided by these two theorems, the known result for channels without feedback and the known result for channels with complete feedback, are both special cases of these two new theorems, because in these cases the bounds coincide. The second problem is the identification via wiretap channels. A secrecy identification capacity is defined for the wiretap channel. A "dichotomy theorem" is proved which says that the second-order secrecy identification capacity is the same as Shannon's capacity for the main channel as long as the secrecy transmission capacity of the wiretap channel is not zero, and zero otherwise. Equivalently, one can say that the identification capacity is not lowered by the presence of a wiretapper as long as 1 bit can be transmitted (or identified) correctly with arbitrarily small error probability. This is in strong contrast to the case of transmission.>

IEEE Transactions on Information Theory•Jul 1, 1995•71 citations

On a special class of wiretap channels

S. Leung-Yan-Cheong

•Jan 1, 1976•31 citations

Secure Deterministic Identification with Feedback and Sensing over State-Dependent Wiretap Channels

Vida Gholamian, Yaning Zhao, Christian Deppe +2 more

Identification differs from classical transmission in that the receiver determines whether a particular identity was sent rather than recovering a message. We study secure deterministic identification over state-dependent discrete memoryless wiretap channels with private noiseless feedback and a sensing distortion constraint. The encoder has no local randomness and uses only the identity and past feedback. A symbol-wise input restriction guarantees the sensing constraint. We show that the secure deterministic identification capacity equals its non-secure feedback counterpart when the admissible main channel has positive ordinary transmission capacity and H(Y|Z,X=x)>0 for some fixed admissible input x. This equality does not require positive classical wiretap secrecy capacity. For achievability, noiseless feedback generates common randomness for identification and enables secret-key extraction by privacy amplification. The extracted key one-time-pad encrypts a short identification tag, whose reliable transmission requires only a sublinear number of additional channel uses. We also present an alternative construction in which feedback-generated randomness replaces the local randomization of a stochastic wiretap encoder. We further prove that secure identification capacity vanishes whenever non-secure identification capacity is zero. We also identify a class of channels with input-independent wiretapper observations that achieves full non-secure identification capacity even when the private conditional feedback entropy is zero, illustrated by a binary state-dependent wiretap channel. Thus, feedback can support both identification and secrecy without local encoder randomization while satisfying sensing constraints.

arXiv:2610.41646•Oct 30, 2026•1 citation

Identification via Quantum Channels

Andreas Winter

arXiv:1212.0494•Lecture notes in computer science•Jan 1, 2013•17 citations
An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound is improved by applying it to a prefix channel, formed by concatenating an auxiliary channel and the actual channel. The bounds are tight if the legitimate channel is more capable than the eavesdropper’s channel. An illustrative example is provided for a wiretap channel that is composed of a point-to-point channel, and a parallel, reversely degraded wiretap channel. A comparison with results for message transmission and for identification with only secrecy constraint is provided.
Studies two problems in the theory of identification via channels. The first problem concerns the identification via channels with noisy feedback. Whereas for Shannon's transmission problem the capacity of a discrete memoryless channel does not change with feedback, it is known that the identification capacity is affected by feedback. The authors study its dependence on the feedback channel. They prove both, a direct and a converse coding theorem. Although a gap exists between the upper and lower bounds provided by these two theorems, the known result for channels without feedback and the known result for channels with complete feedback, are both special cases of these two new theorems, because in these cases the bounds coincide. The second problem is the identification via wiretap channels. A secrecy identification capacity is defined for the wiretap channel. A "dichotomy theorem" is proved which says that the second-order secrecy identification capacity is the same as Shannon's capacity for the main channel as long as the secrecy transmission capacity of the wiretap channel is not zero, and zero otherwise. Equivalently, one can say that the identification capacity is not lowered by the presence of a wiretapper as long as 1 bit can be transmitted (or identified) correctly with arbitrarily small error probability. This is in strong contrast to the case of transmission.>
Identification differs from classical transmission in that the receiver determines whether a particular identity was sent rather than recovering a message. We study secure deterministic identification over state-dependent discrete memoryless wiretap channels with private noiseless feedback and a sensing distortion constraint. The encoder has no local randomness and uses only the identity and past feedback. A symbol-wise input restriction guarantees the sensing constraint. We show that the secure deterministic identification capacity equals its non-secure feedback counterpart when the admissible main channel has positive ordinary transmission capacity and H(Y|Z,X=x)>0 for some fixed admissible input x. This equality does not require positive classical wiretap secrecy capacity. For achievability, noiseless feedback generates common randomness for identification and enables secret-key extraction by privacy amplification. The extracted key one-time-pad encrypts a short identification tag, whose reliable transmission requires only a sublinear number of additional channel uses. We also present an alternative construction in which feedback-generated randomness replaces the local randomization of a stochastic wiretap encoder. We further prove that secure identification capacity vanishes whenever non-secure identification capacity is zero. We also identify a class of channels with input-independent wiretapper observations that achieves full non-secure identification capacity even when the private conditional feedback entropy is zero, illustrated by a binary state-dependent wiretap channel. Thus, feedback can support both identification and secrecy without local encoder randomization while satisfying sensing constraints.