Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Secrecy capacity of a class of broadcast channels with an eavesdropper
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Secured communication over frequency-selective fading channels: a practical vandermonde precoding
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
The secrecy capacity of the semi-deterministic broadcast channel
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
3-receiver broadcast channels with common and confidential messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Secure diversity-multiplexing tradeoffs in MIMO relay channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
Secret sharing over fast-fading MIMO wiretap channels
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless physical layer security
A note on information-theoretic secret key exchange over wireless channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Utility of beamforming strategies for secrecy in multiuser MIMO wiretap channels
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Secrecy capacity region of the degraded compound multi-receiver wiretap channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Secure joint source-channel coding for quasi-static fading channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Gaussian MIMO multi-receiver wiretap channel
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Ergodic secrecy capacity region of the fading broadcast channel
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Secure transmission with multiple antennas I: the MISOME wiretap channel
IEEE Transactions on Information Theory
User selection in multiuser MIMO systems with secrecy considerations
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
On multiuser secrecy rate in flat fading channel
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Active eavesdropping in fast fading channels
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Secure transmission with multiple antennas: part II: the MIMOME wiretap channel
IEEE Transactions on Information Theory
Leakage-probability-constrained secrecy capacity of a fading channel
Security and Communication Networks
Limitations of generating a secret key using wireless fading under active adversary
IEEE/ACM Transactions on Networking (TON)
Control of wireless networks with secrecy
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 754.96 |
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.