Quantum privacy and quantum wiretap channels
Problems of Information Transmission
General theory of information transfer: Updated
Discrete Applied Mathematics
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Information-theoretic key agreement: from weak to strong secrecy for free
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Optimal coding strategies for bidirectional broadcast channels under channel uncertainty
IEEE Transactions on Communications
IEEE Transactions on Information Theory
Strong converse for identification via quantum channels
IEEE Transactions on Information Theory
The private classical capacity and quantum capacity of a quantum channel
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We derive a lower bound on the secrecy capacity of a 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. [1], 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 randomization in the encoding. This relieves us from the need of decoding the randomization parameter, which is in general impossible within this model. Moreover, we prove a lower bound on the secrecy capacity of a compound wiretap channel without channel state information and derive a multiletter expression for the capacity in this communication scenario.