Secrecy Results for Compound Wiretap Channels

Abstract

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterion, and with a decoder that is robust against the effect of randomisation in the encoding. This relieves us from the need of decoding the randomisation parameter which is in general not possible within this model. Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information and derive a multi-letter expression for the capacity in this communication scenario.

25 pages, 1 figure. Accepted for publication in the journal "Problems of Information Transmission". Some of the results were presented at the ITW 2011 Paraty [arXiv:1103.0135] and published in the conference paper available at the IEEE Xplore

Cited by in corpus (19)

• The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability and Super-Activation
• A channel under simultaneous jamming and eavesdropping attack---correlated random coding capacities under strong secrecy criteria
• Achieving Positive Covert Capacity over MIMO AWGN Channels
• On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels
• Secure Broadcasting Using Independent Secret Keys
• Secrecy capacities of compound quantum wiretap channels and applications
• Strong Secrecy for Multiple Access Channels
• Positivity, Discontinuity, Finite Resources and Nonzero Error for Arbitrarily Varying Quantum Channels
• Second-order coding rates for key distillation in quantum key distribution
• Classical-Quantum Arbitrarily Varying Wiretap Channel: Ahlswede dichotomy, Positivity, Resources, Super Activation
• Rank-Deficient Solutions for Optimal Signaling over Wiretap MIMO Channels
• The MAC Resolvability Region, Semantic Security and Its Operational Implications
• Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver
• Secret-Key Generation from Private Identifiers under Channel Uncertainty
• An Improved Feedback Coding Scheme for the Wire-tap Channel
• Secure Identification for Gaussian Channels and Identification for Multi-Antenna Gaussian Channels
• On Effective Convergence in Fekete's Lemma and Related Combinatorial Problems in Information Theory
• Secure Polar Coding with Delayed Wiretapping Information