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

arXiv:1606.01768 · Quantum Information Processing

Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity

Holger Boche, Minglai Cai, Christian Deppe, Janis Nötzel

Published Dec 24, 2016• 12 citations
arXivHTMLPDF
DOI
10.1007/s11128-016-1473-y

Related papers

Classical-Quantum Arbitrarily Varying Wiretap Channel

Vladimir M. Blinovsky, Minglai Cai

arXiv:1208.1151•Lecture notes in computer science•Jan 1, 2013•8 citations

Classical–quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation

Holger Boche, Minglai Cai, Christian Deppe +1 more

arXiv:1307.8007•Quantum Information Processing•Aug 8, 2016•18 citations

The Discrete Memoryless Arbitrarily Varying Wiretap Channel

Janis Nötzel, Moritz Wiese, Holger Boche

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

Capacity Results for Arbitrarily Varying Wiretap Channels

Igor Bjelaković, Holger Boche, Jochen Sommerfeld

arXiv:1209.5213•Lecture notes in computer science•Jan 1, 2013•83 citations

Classical-quantum arbitrarily varying wiretap channel: Common randomness assisted code and continuity

Holger Boche, Minglai Cai, Christian Deppe +1 more

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels. Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legal receiver and varies arbitrarily from the sender to the eavesdropper. As an application we examine when the secrecy capacity is a continuous function of the system parameters and show that resources, i.e., having access to a perfect copy of the outcome of a random experiment, are helpful for channel stability.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•17 citations

On arbitrarily varying wiretap channels for different classes of secrecy measures

Holger Boche, Rafael F. Schaefer, H. Vincent Poor

The wiretap channel models secure communication in the presence of an eavesdropper who must be kept ignorant of transmitted messages. In this paper, the arbitrarily varying wiretap channel (AVWC), in which the channel may vary in an unknown and arbitrary manner from channel use to channel use, is considered. For arbitrarily varying channels (AVCs) the capacity might differ depending on whether deterministic or common randomness (CR) assisted codes are used. The AVWC has been studied for both coding strategies and the relation between the corresponding secrecy capacities has been established. However, a characterization of the CR-assisted secrecy capacity itself or even a general CR-assisted achievable secrecy rate remain open in general for weak and strong secrecy. Here, the secrecy measure of high decoding error at the eavesdropper is considered, where the eavesdropper is further assumed to know channel states and to adapt its decoding strategy accordingly. For this secrecy measure a general CR-assisted achievable secrecy rate is established. The relation between secrecy capacities for different secrecy measures is discussed: The weak and strong secrecy capacities are smaller than or equal to the one for high decoding error. It is conjectured that this relation can be strict for certain channels.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•11 citations
We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels. Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legal receiver and varies arbitrarily from the sender to the eavesdropper. As an application we examine when the secrecy capacity is a continuous function of the system parameters and show that resources, i.e., having access to a perfect copy of the outcome of a random experiment, are helpful for channel stability.
The wiretap channel models secure communication in the presence of an eavesdropper who must be kept ignorant of transmitted messages. In this paper, the arbitrarily varying wiretap channel (AVWC), in which the channel may vary in an unknown and arbitrary manner from channel use to channel use, is considered. For arbitrarily varying channels (AVCs) the capacity might differ depending on whether deterministic or common randomness (CR) assisted codes are used. The AVWC has been studied for both coding strategies and the relation between the corresponding secrecy capacities has been established. However, a characterization of the CR-assisted secrecy capacity itself or even a general CR-assisted achievable secrecy rate remain open in general for weak and strong secrecy. Here, the secrecy measure of high decoding error at the eavesdropper is considered, where the eavesdropper is further assumed to know channel states and to adapt its decoding strategy accordingly. For this secrecy measure a general CR-assisted achievable secrecy rate is established. The relation between secrecy capacities for different secrecy measures is discussed: The weak and strong secrecy capacities are smaller than or equal to the one for high decoding error. It is conjectured that this relation can be strict for certain channels.