TY - JOUR
T1 - Secrecy capacity region of a multiple-antenna Gaussian broadcast channel with confidential messages
AU - Liu, Ruoheng
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received September 28, 2007; revised November 08, 2008. Current version published February 25, 2009. This work was supported by the National Science Foundation under Grants ANI-03-38807, CNS-06-25637, and CCF-07-28208. The material in this paper was presented in part at the First International Workshop on Information Theory for Sensor Networks, Santa Fe, NM, June 2007, and the 2008 IEEE International Symposium on Information Theory (ISIT), Toronto, ON, Canada, July 2008.
PY - 2009
Y1 - 2009
N2 - Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.
AB - Wireless communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multiple-antenna transmitter wishes to send independent confidential messages to two users with information-theoretic secrecy. That is, each user would like to obtain its own confidential message in a reliable and safe manner. This communication model is referred to as the multiple-antenna Gaussian broadcast channel with confidential messages (MGBC-CM). Under this communication scenario, a secret dirty-paper coding scheme and the corresponding achievable secrecy rate region are first developed based on Gaussian codebooks. Next, a computable Sato-type outer bound on the secrecy capacity region is provided for the MGBC-CM. Furthermore, the Sato-type outer bound proves to be consistent with the boundary of the secret dirty-paper coding achievable rate region, and hence, the secrecy capacity region of the MGBC-CM is established. Finally, two numerical examples demonstrate that both users can achieve positive rates simultaneously under the information-theoretic secrecy requirement.
KW - Broadcast channels
KW - Information-theoretic secrecy
KW - Multiple antennas
KW - Secret communication
UR - http://www.scopus.com/inward/record.url?scp=62749109096&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=62749109096&partnerID=8YFLogxK
U2 - 10.1109/TIT.2008.2011448
DO - 10.1109/TIT.2008.2011448
M3 - Article
AN - SCOPUS:62749109096
SN - 0018-9448
VL - 55
SP - 1235
EP - 1249
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -