IEEE Transactions on Information Theory · 2011 · 36 citations · 23 references
EngineeringComputer ScienceElectrical EngineeringDigital CommunicationInformation TheoryWireless CommunicationsChannel CapacityCoding TheoryInformation-theoretic SecurityInformation-theoretic CapacityInformation-theoretic Secrecy CapacityInterferenceInterference ChannelInterference Channel With Confidential MessagesRelay Channel With Confidential MessagesSecrecy Capacity
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 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> -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 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> , 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.
23
Communication Theory of Secrecy Systems*
Claude E. Shannon · Bell System Technical Journal · 1949 · 9.3K citations
A.D. Wyner · Bell System Technical Journal · 1975 · 7.1K citations