The Gaussian Many-to-One Interference Channel With Confidential Messages

• Published in: IEEE transactions on information theory Vol. 57; no. 5; pp. 2730 - 2745
• Main Authors: Xiang He, Yener, A
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.05.2011; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Channel models; Channels; Codes; Communication channels; Communications networks; Degrees of freedom; Electric noise; Gain; Gaussian; Information theoretic secrecy; Information theory; Interference; interference channel; Interference channels; lattice code; Lattices; Mathematical analysis; Messages; Receivers; Transmitters; Upper bound; Upper bounds
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2011.2119650

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K -user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subject to interference, is also one from which the interfering users' messages need to be kept secret from. We derive the achievable secrecy sum rate for this channel using nested lattice codes, as well as an upper bound on the secrecy sum rate for all possible channel gain configurations. We identify several nontrivial cases where the gap between the upper bound and the achieved secrecy sum rate is only a function of the number of the users K , and is uniform over all possible channel gain configurations in each case. In addition, we identify the secure degrees of freedom for this channel and show it to be equivalent to its degrees of freedom, i.e., the secrecy in high SNR comes for free.