Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions
Top Cited Papers
- 23 May 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 54 (6) , 2493-2507
- https://doi.org/10.1109/tit.2008.921879
Abstract
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.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Secure Communication Over Fading ChannelsIEEE Transactions on Information Theory, 2008
- Cooperative Secrecy: The Relay-Eavesdropper ChannelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- On the Secrecy Capacity of Fading ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- An Achievable Secrecy Throughput of Hybrid-ARQ Protocols for Block Fading ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- The Gaussian multiple access wire-tap channel: wireless secrecy and cooperative jammingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- The Discrete Memoryless Multiple Access Channel with Confidential MessagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Secrecy Capacity of Wireless ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Coding for relay channels with confidential messagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)IEEE Transactions on Information Theory, 1981
- A coding theorem for the discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1979