Secrecy results for compound wiretap channels
From MaRDI portal
Publication:361702
DOI10.1134/S0032946013010079zbMATH Open1328.94045arXiv1106.2013MaRDI QIDQ361702FDOQ361702
Authors: Holger Boche, J. Sommerfeld, Igor Bjelaković 
Publication date: 19 August 2013
Published in: Problems of Information Transmission (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1106.2013
Recommendations
Cites Work
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- Concentration of Measure for the Analysis of Randomized Algorithms
- The Capacity of a Class of Channels
- Strong converse for identification via quantum channels
- Almost independence of random variables and capacity of a secrecy channel
- Information-theoretic key agreement: from weak to strong secret for free
- Title not available (Why is that?)
- Identification via channels
- The Wire-Tap Channel
- Common randomness in information theory and cryptography. I. Secret sharing
- General theory of information transfer: Updated
Cited In (22)
- Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
- Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- On message protection in cryptosystems modelled as the generalized wire-tap channel II
- Strong secrecy for multiple access channels
- The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation
- Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation
- Wiretap channel in the presence of action-dependent states and noiseless feedback
- A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
- Secrecy Generation for Multiaccess Channel Models
- Strong Secrecy From Channel Resolvability
- Separability and the detection of hidden channels
- The Wiretap Channel With Feedback: Encryption Over the Channel
- Semantic security for the wiretap channel
- An achievable region for the Gaussian wiretap channel with side information
- Wiretap Channel With Side Information
- A New Wiretap Channel Model and Its Strong Secrecy Capacity
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
- Capacity results for arbitrarily varying wiretap channels
- Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
- The Secrecy Capacity of Cost-Constrained Wiretap Channels
- Strong Secrecy for Wireless Channels (Invited Talk)
This page was built for publication: Secrecy results for compound wiretap channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361702)
