Secrecy Capacity Region of Fading Broadcast Channels
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1291-1295
Abstract
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The secrecy capacity region is first established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the Gaussian case of the Csiszar-Korner BCC model. The secrecy capacity results are then applied to give the ergodic secrecy capacity region for the fading BCC.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Secrecy Capacity of Wireless Channels2006
- Secrecy capacity of SIMO and slow fading channels2005
- Optimal power allocation over parallel Gaussian broadcast channels2002
- Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacityIEEE Transactions on Information Theory, 2001
- A coding theorem for secret sharing communication systems with two Gaussian wiretap channelsIEEE Transactions on Information Theory, 1991
- The Gaussian wire-tap channelIEEE Transactions on Information Theory, 1978
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- The Wire-Tap ChannelBell System Technical Journal, 1975