Capacity results for arbitrarily varying wiretap channels
From MaRDI portal
(Redirected from Publication:4915233)
Abstract: In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede's robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the deterministic code secrecy capacity equals the random code secrecy capacity, a result similar to Ahlswede's dichotomy result for ordinary AVCs. Using this we can derive that the lower bound is also valid for the deterministic code capacity of the AVWC. The proof of the dichotomy result is based on the elimination technique introduced by Ahlswede for ordinary AVCs. We further prove upper bounds on the deterministic code secrecy capacity in the general case, which results in a multi-letter expression for the secrecy capacity in the case of a best channel to the eavesdropper. Using techniques of Ahlswede, developed to guarantee the validity of a reliability criterion, the main contribution of this work is to integrate the strong secrecy criterion into these techniques.
Recommendations
- The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
- Secrecy results for compound wiretap channels
- Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
- The capacity of the arbitrarily varying channel revisited: positivity, constraints
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
Cites work
- A Note on the Existence of the Weak Capacity for Channels with Arbitrarily Varying Channel Probability Functions and Its Relation to Shannon's Zero Error Capacity
- Arbitrarily varying channels with states sequence known to the sender
- Common randomness in information theory and cryptography. I. Secret sharing
- Common randomness in information theory and cryptography. II. CR capacity
- Elimination of correlation in random codes for arbitrarily varying channels
- Exponential error bounds for random codes in the arbitrarily varying channel
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- Secrecy results for compound wiretap channels
- The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
- The capacity of the arbitrarily varying channel revisited: positivity, constraints
Cited in
(10)- The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
- Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
- The Degraded Poisson Wiretap Channel
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder
- Secrecy results for compound wiretap channels
- Classical-Quantum Arbitrarily Varying Wiretap Channel
- Strong Secrecy for Wireless Channels (Invited Talk)
- The optimal causal linear predictor is not Turing computable
This page was built for publication: Capacity results for arbitrarily varying wiretap channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915233)