Secrecy results for compound wiretap channels
From MaRDI portal
(Redirected from Publication:361702)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4085568 (Why is no real title available?)
- Almost independence of random variables and capacity of a secrecy channel
- Common randomness in information theory and cryptography. I. Secret sharing
- Concentration of Measure for the Analysis of Randomized Algorithms
- General theory of information transfer: Updated
- Identification via channels
- Information-theoretic key agreement: from weak to strong secret for free
- Strong converse for identification via quantum channels
- The Capacity of a Class of Channels
- The Private Classical Capacity and Quantum Capacity of a Quantum Channel
- The Wire-Tap Channel
Cited in
(25)- Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
- A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
- On message protection in cryptosystems modelled as the generalized wire-tap channel II
- The Secrecy Capacity of Cost-Constrained Wiretap Channels
- An achievable region for the Gaussian wiretap channel with side information
- Wiretap channel in the presence of action-dependent states and noiseless feedback
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Asymptotic bound of secrecy capacity for MIMOME-based transceivers: a suboptimally tractable solution for imperfect CSI
- Separability and the detection of hidden channels
- Semantic security for the wiretap channel
- Strong Secrecy for Wireless Channels (Invited Talk)
- Some new results on the wiretap channel with side information
- Strong secrecy for multiple access channels
- The Wiretap Channel With Feedback: Encryption Over the Channel
- Wiretap channel with action-dependent channel state information
- Wiretap Channel With Side Information
- A New Wiretap Channel Model and Its Strong Secrecy Capacity
- 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
- Capacity results for arbitrarily varying wiretap channels
- Secrecy Generation for Multiaccess Channel Models
- Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
- Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
- Strong Secrecy From Channel Resolvability
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
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)
