TY - JOUR
T1 - MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages
AU - Goldfeld, Ziv
AU - Permuter, Haim H.
N1 - Funding Information:
Manuscript received August 21, 2016; revised July 30, 2018; accepted October 24, 2018. Date of publication January 11, 2019; date of current version March 15, 2019. Z. Goldfeld and H. H. Permuter was supported in part by the Israel Science Foundation under Grant 2012/14, in part by the European Research Council through the European Union’s Seventh Framework Programme under Grant FP7/2007-2013, in part by ERC under Grant 337752, and in part by the Cyber Center, Ben-Gurion University of the Negev. Z. Goldfeld was also supported in part by the Rothschild Post-Doctoral Fellowship and in part by Skoltech–MIT Joint Next Generation Program.
Funding Information:
Z. Goldfeld and H. H. Permuter was supported in part by the Israel Science Foundation under Grant 2012/14, in part by the European Research Council through the European Union's Seventh Framework Programme under Grant FP7/2007-2013, in part by ERC under Grant 337752, and in part by the Cyber Center, Ben-Gurion University of the Negev. Z. Goldfeld was also supported in part by the Rothschild Post-Doctoral Fellowship and in part by Skoltech-MIT Joint Next Generation Program.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/4/1
Y1 - 2019/4/1
N2 - The two-user multiple-input multiple-output Gaussian broadcast channel with common, private, and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to the User 1 and a private (non-confidential) message to the User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary points are achieved by Gaussian inputs, which enables the development of a tight converse. The proof relies on the factorization of upper concave envelopes and a variant of dirty-paper coding (DPC). It is shown that the entire region is exhausted by using DPC to cancel out the signal of the non-confidential message at Receiver 1, thus making DPC against the signal of the confidential message unnecessary. A numerical example illustrates the secrecy-capacity results.
AB - The two-user multiple-input multiple-output Gaussian broadcast channel with common, private, and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to the User 1 and a private (non-confidential) message to the User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary points are achieved by Gaussian inputs, which enables the development of a tight converse. The proof relies on the factorization of upper concave envelopes and a variant of dirty-paper coding (DPC). It is shown that the entire region is exhausted by using DPC to cancel out the signal of the non-confidential message at Receiver 1, thus making DPC against the signal of the confidential message unnecessary. A numerical example illustrates the secrecy-capacity results.
KW - Additive Gaussian channel
KW - broadcast channel
KW - dirty-paper coding multiple-input multiple-output (MIMO) communications
KW - physical-layer security
KW - upper concave envelopes
UR - http://www.scopus.com/inward/record.url?scp=85063277727&partnerID=8YFLogxK
U2 - 10.1109/TIT.2019.2892107
DO - 10.1109/TIT.2019.2892107
M3 - Article
AN - SCOPUS:85063277727
SN - 0018-9448
VL - 65
SP - 2525
EP - 2544
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 4
M1 - 8610182
ER -