Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions
By Ruoheng Liu, Ivana Maric, Predrag Spasojevic, Roy D. Yates. IEEE Transactions on Information Theory, 2007
465 citations recorded by the source corpus.
We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers while ensuring mutual information-theoretic secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. In this paper, we present inner and outer bounds on secrecy capacity regions for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to both channel models. The difference is in the input distributions over which the expression is optimized. The inner bound rate regions are achieved by random binning techniques. For the broadcast channel, a double-binning coding scheme allows for both joint encoding and preserving of confidentiality. Furthermore, we show that, for a special case of the interference channel, referred to as the switch channel, derived bounds meet. Finally, we describe several transmission schemes for Gaussian interference channels and derive their achievable rate regions while ensuring mutual information-theoretic secrecy. An encoding scheme in which transmitters dedicate some of their power to create artificial noise is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/a385c2f96bd08e355ef283f2798d7c1afefa9984
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- A. Mukherjee
- Jing Huang
- A. L. Swindlehurst
- S. Ali A. Fakoorian
- Nan Liu
- Aylin Yener
- Sennur Ulukus
- Ender Tekin
In Electrical and Electronic Engineering
- Aylin Yener
- A. L. Swindlehurst
- Jing Huang
- A. Mukherjee
- Ender Tekin
- Xiang He
- S. Ali A. Fakoorian
- Sennur Ulukus
Citations in the corpus
- Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey (2010, background): “The more general case, where each receiver acts as an eavesdropper for the other transmitter, was studied in [84] where, in the absence of a common message, the authors imposed a perfect secrecy constraint and obtained inner and outer bounds for the perfe ct secrecy capacity region.”
- Cooperation With an Untrusted Relay: A Secrecy Perspective (2009, background): “This setting has been considered for the multipl e access [15], broadcast [16], [17], and interference channels [18], [19].”
- Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel (2007, background): “, multiple access channel [11]–[15], broadcast channel [16], relay channel [17], [18], interference channel [19], and two-way channel [20], and in fading channels [7], [21]–[25] have been considered recently.”
- Secure Transmission in Cognitive Satellite Terrestrial Networks (2016, background): “If the eavesdropper is a malicious receiver, it can add an extra receiver to decode the terrestrial network by using SIC (even if it is a satellite receiver) [27], [28].”
- The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming (2007, background): “Broadcast and interference channels with confidential messages were considered in [33].”