Capacity Bounds for Broadcast Channels With Confidential Messages

DOI10.1109/TIT.2009.2027500MaRDI QIDQ4974015zbMATH OpenFDO

Authors Jin Xu, Yi Cao, Biao Chen

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.4374

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)

Abstract: In this paper, we study 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. We propose both inner and outer bounds to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csisz'{a}r and K"{o}rner's rate equivocation region for broadcast channels with a single confidential message, Liu {em et al}'s achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand and Pinsker's achievable rate region for general broadcast channels. Our proposed outer bounds, together with the inner bound, helps establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including less noisy, deterministic, and semi-deterministic channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.

Recommendations

• Random coding bound for \(E\)-capacity region of the broadcast channel with confidential messages
• On a special class of broadcast channels with confidential messages
• Another Proof for the Secrecy Capacity of the K-Receiver Broadcast Channel With Confidential Messages
• New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages
• Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages
• The Optimal Use of Rate-Limited Randomness in Broadcast Channels With Confidential Messages
• Capacity Region of Gaussian MIMO Broadcast Channels With Common and Confidential Messages
• Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages
• Achieving Secrecy Capacity of the Wiretap Channel and Broadcast Channel With a Confidential Component

Cited in

(7)

• Random coding bound for \(E\)-capacity region of the broadcast channel with confidential messages
• Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
• Multiple-Access Channels With Confidential Messages
• Degraded Broadcast Channel With Secrecy Outside a Bounded Range
• scientific article; zbMATH DE number 1421003 (Why is no real title available?)
• Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
• The private classical capacity region of classical-quantum broadcasting channel with three receivers

This page was built for publication: Capacity Bounds for Broadcast Channels With Confidential Messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974015)