The Gaussian Many-to-One Interference Channel With Confidential Messages
Authors:
- 19 April 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (5) , 2730-2745
Abstract
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.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Interference Alignment for SecrecyIEEE Transactions on Information Theory, 2011
- The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference ChannelsIEEE Transactions on Information Theory, 2010
- Interference alignment via random codes and he capacity of a class of deterministic interference channels2009
- Secrecy generation for multiple input multiple output channel models2009
- A new outer bound for the gaussian interference channel with confidential messages2009
- A layered lattice coding scheme for a class of three user Gaussian interference channels2008
- Interference-assisted secret communication2008
- Achieving$ 1over 2log (1+ hboxSNR)$on the AWGN Channel With Lattice Encoding and DecodingIEEE Transactions on Information Theory, 2004
- Averaging bounds for lattices and linear codesIEEE Transactions on Information Theory, 1997
- The Gaussian wire-tap channelIEEE Transactions on Information Theory, 1978