Secure Broadcasting Over Fading Channels
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) , 2453-2469
- https://doi.org/10.1109/tit.2008.921861
Abstract
We study a problem of broadcasting confidential messages to multiple receivers under an information-theoretic secrecy constraint. Two scenarios are considered: 1) all receivers are to obtain a common message; and 2) each receiver is to obtain an independent message. Moreover, two models are considered: parallel channels and fast-fading channels. For the case of reversely degraded parallel channels, one eavesdropper, and an arbitrary number of legitimate receivers, we determine the secrecy capacity for transmitting a common message, and the secrecy sum-capacity for transmitting independent messages. For the case of fast-fading channels, we assume that the channel state information of the legitimate receivers is known to all the terminals, while that of the eavesdropper is known only to itself. We show that, using a suitable binning strategy, a common message can be reliably and securely transmitted at a rate independent of the number of receivers. We also show that a simple opportunistic transmission strategy is optimal for the reliable and secure transmission of independent messages in the limit of large number of receivers.Keywords
This publication has 19 references indexed in Scilit:
- Secure Communication Over Fading ChannelsIEEE Transactions on Information Theory, 2008
- On the Secrecy Capacity of Fading ChannelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- Elements of Information TheoryPublished by Wiley ,2001
- Capacity and optimal resource allocation for fading broadcast channels .I. Ergodic capacityIEEE Transactions on Information Theory, 2001
- Information-Theoretic Key Agreement: From Weak to Strong Secrecy for FreePublished by Springer Nature ,2000
- On the capacity of some channels with channel state informationIEEE Transactions on Information Theory, 1999
- Capacity of fading channels with channel side informationIEEE Transactions on Information Theory, 1997
- Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, 1993
- The Gaussian wire-tap channelIEEE Transactions on Information Theory, 1978
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978