Elements of information theory
Elements of information theory
Towards the secrecy capacity of the Gaussian MIMO wire-tap channel: the 2-2-1 channel
IEEE Transactions on Information Theory
Comments on broadcast channels
IEEE Transactions on Information Theory
Secrecy capacities for multiple terminals
IEEE Transactions on Information Theory
An Outer Bound to the Capacity Region ofthe Broadcast Channel
IEEE Transactions on Information Theory
Rate Regions for Relay Broadcast Channels
IEEE Transactions on Information Theory
Multiple-Access Channels With Confidential Messages
IEEE Transactions on Information Theory
Secure Communication Over Fading Channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The Relay–Eavesdropper Channel: Cooperation for Secrecy
IEEE Transactions on Information Theory
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
The secrecy capacity of the semi-deterministic broadcast channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the compound MIMO broadcast channels with confidential messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Hi-index | 754.84 |
This paper studies capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. Both inner and outer bounds are proposed to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csiszár and Körner's rate equivocation region for broadcast channels with a single confidential message, Liu et al.'s achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand-Pinsker's achievable rate region for general broadcast channels. The proposed outer bounds, together with the inner bound, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including the less noisy, deterministic, and semideterministic broadcast channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, the proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.