Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. A matrix characterization of the secrecy capacity region is established via a channel enhancement argument. The enhanced channel is constructed by first splitting receiver 1 into two virtual receivers and then enhancing only the virtual receiver that decodes the confidential message. The secrecy capacity region of the enhanced channel is characterized using an extremal entropy inequality previously established for characterizing the capacity region of a degraded compound MIMO Gaussian broadcast channel.

[1]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[2]  Shlomo Shamai,et al.  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel , 2006, IEEE Transactions on Information Theory.

[3]  Shlomo Shamai,et al.  A Note on the Secrecy Capacity of the Multiple-Antenna Wiretap Channel , 2007, IEEE Transactions on Information Theory.

[4]  Nan Liu,et al.  Towards the Secrecy Capacity of the Gaussian MIMO Wire-Tap Channel: The 2-2-1 Channel , 2007, IEEE Transactions on Information Theory.

[5]  Frédérique E. Oggier,et al.  The secrecy capacity of the MIMO wiretap channel , 2007, 2008 IEEE International Symposium on Information Theory.

[6]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas I: The MISOME Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[7]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  Joy A. Thomas,et al.  Feedback can at most double Gaussian multiple access channel capacity , 1987, IEEE Trans. Inf. Theory.

[10]  Hiroshi Sato,et al.  An outer bound to the capacity region of broadcast channels (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[11]  Shlomo Shamai,et al.  MIMO Gaussian broadcast channels with confidential messages , 2009, 2009 IEEE International Symposium on Information Theory.

[12]  Sennur Ulukus,et al.  Capacity Region of Gaussian MIMO Broadcast Channels With Common and Confidential Messages , 2012, IEEE Trans. Inf. Theory.

[13]  Shlomo Shamai,et al.  MIMO Gaussian broadcast channels with confidential and common messages , 2010, 2010 IEEE International Symposium on Information Theory.

[14]  Shlomo Shamai,et al.  On the Capacity Region of the Multi-Antenna Broadcast Channel with Common Messages , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Shlomo Shamai,et al.  The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel , 2009, IEEE Transactions on Information Theory.

[16]  Ami Wiesel,et al.  On the Gaussian MIMO Wiretap Channel , 2007, 2007 IEEE International Symposium on Information Theory.

[17]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[18]  G. Wornell,et al.  Secure Transmission with Multiple Antennas: The MIMOME Channel , 2008 .

[19]  János Körner,et al.  General broadcast channels with degraded message sets , 1977, IEEE Trans. Inf. Theory.

[20]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.