MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages

DOI10.1109/TIT.2019.2892107zbMATH Open1431.94090arXiv1608.06057MaRDI QIDQ5223947FDOQ5223947

Authors: Ziv Goldfeld, Haim Permuter 

Publication date: 19 July 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a private (non-confidential) message to 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 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.

Full work available at URL: https://arxiv.org/abs/1608.06057

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)

Cited In (2)

• Structured Mappings and Conferencing Common Information for Multiple-Access Channels
• Degrees of Freedom of the Two-User MIMO Broadcast Channel with Private and Common Messages Under Hybrid CSIT Models

This page was built for publication: MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223947)