Allerton Conference on Communication, Control, and Computing

On the secure interference channel

Anelia Somekh-Baruch

Published Oct 1, 2013• 3 citations

Abstract

We introduce a secure communication setup of an interference channel whose transmitted signals are fed into interleavers. The interleavers apply random permutations to the signals, and the realizations of the permutations are made known to the receivers but not the transmitters. This communication setup can also model a situation in which the encoders are ignorant of the codebooks of one another, while the decoders are cognizant of the codebooks. We study the capacity region of a two-user secure Z-interference channel, and prove that an asymptotically optimal strategy of the interfered user is to use a constant composition random code. Consequently we establish the result that the capacity region of this channel, in the weak interference regime, is obtained by the Han-Kobayashi coding scheme. Further, we present an outer bound for the secure additive doubly weak interference channel, and an outer bound on the capacity region of the secure additive interference channel with mixed interference.

DOI: 10.1109/allerton.2013.6736602

Related papers

The Gaussian Interference Channel in the Presence of Malicious Jammers

Fatemeh Hosseinigoki, Oliver Kosut

This paper considers the two-user Gaussian interference channel in the presence of adversarial jammers. We first provide a general model including an arbitrary number of jammers, and show that its capacity region is equivalent to that of a simplified model in which the received jamming signal at each decoder is independent. Next, existing outer and inner bounds for two-user Gaussian interference channel are generalized for this simplified jamming model. We show that for certain problem parameters, precisely the same bounds hold, but with the noise variance increased by the received power of the jammer at each receiver. Thus, the jammers can do no better than to transmit Gaussian noise. For these problem parameters, this allows us to recover the half-bit theorem. In weak and strong interference regime, our inner bound matches the corresponding Han-Kobayashi bound with increased noise variance by the received power of the jammer, and even in strong interference we achieve the exact capacity. Furthermore, we determine the symmetric degrees of freedom where the signal-to-noise, interference-to-noise and jammer-to-noise ratios are all tend to infinity. Moreover, we show that, if the jammer has greater received power than the legitimate user, symmetrizability makes the capacity zero. The proof of the outer bound is straightforward, while the inner bound generalizes the Han-Kobayashi rate splitting scheme. As a novel aspect, the inner bound takes advantage of the common message acting as common randomness for the private message; hence, the jammer cannot symmetrize only the private codeword without being detected. This complication requires an extra condition on the signal power, so that in general our inner bound is not identical to the Han-Kobayashi bound. We also prove a new variation of the packing lemma that applies for multiple Gaussian codebooks in an adversarial setting.

arXiv:1712.04133Dec 12, 20175 citations

Security in the Gaussian interference channel: Weak and moderately weak interference regimes

Parisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the moderately weak interference regimes, in which the reliability as well as the confidentiality of the transmitted messages are maintained at any finite SNR value. Our scheme uses lattice structure, structured jamming codewords, and lattice alignment in the encoding and the asymmetric compute-and-forward strategy in the decoding. We show that our lower bound on the sum secure rates scales linearly with log(SNR) and hence, it outperforms i.i.d. Gaussian random codes. Furthermore, we show that our achievable result is asymptotically optimal. Finally, we provide a discussion on an extension of our scheme to K > 2 users.

arXiv:1604.07386IEEE International Symposium on Information Theory (ISIT)Jul 1, 20163 citations

Secure Multiplex Coding Over Interference Channel with Confidential Messages

Li, Xiaolin, Ryutaroh Matsumoto

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the best achievable capacity region for interference channel up to now, we have shown that the improved secure capacity region compared with [2] now is the whole Han-Kobayashi region. In addition, this construction not only removes the rate loss incurred by adding dummy messages to achieve security, but also change the original weak security condition in [2] to strong security. Then the equivocation rate for a collection of secret messages has also been evaluated, when the length of the message is finite or the information rate is high, our result provides a good approximation for bounding the worst case equivocation rate. Our results can be readily extended to the Gaussian interference channel with little efforts.

arXiv:1109.4074Sep 19, 20111 citation

On the Optimality of Secure Communication Without Using Cooperative Jamming

Jinyuan Chen

We consider secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian wiretap codebook at each transmitter (without cooperative jamming) and treating interference as noise at each intended receiver (in short, GWC-TIN scheme) achieves the optimal secure sum capacity to within a constant gap. The results are proved by first considering the deterministic interference channel model and identifying a regime in which a simple scheme without using cooperative jamming is optimal in terms of secure sum capacity. For the symmetric case of the deterministic model, this simple scheme is optimal if and only if the interference-to-signal ratio (in channel strengths) is no more than 2/3.

arXiv:1706.06220Jun 19, 20172 citations

Capacity of the deterministic z-interference channel with unidirectional transmitter cooperation and secrecy constraints

Parthajit Mohapatra, Chandra R. Murthy

This paper derives the capacity region of the 2- user symmetric linear deterministic Z-interference channel (Z-IC) with limited-rate unidirectional cooperation between the transmitters and secrecy constraints at the receivers. The proposed achievable scheme uses a combination of transmission of random bits and interference cancelation. A novel outer bound is derived, based on carefully selecting the side information, and partitioning the encoded message/output depending on the relative strength of the signal and the interference. The derived bounds match, thereby characterizing the secrecy capacity region of the symmetric Z-IC with unidirectional transmitter cooperation. Interestingly, it is found that, in the weak/moderate interference regime, the capacity region does not decrease due to the secrecy constraint at the receiver. Hence, the proposed scheme achieves the capacity of the Z-IC for the weak/moderate interference regime with and without secrecy constraints at the receivers. The results highlight the role of the unidirectional transmitter cooperation in facilitating secure communication over a 2-user ZIC in the high interference regime.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20151 citation

On the Secrecy Capacity Region of the 2-user Z Interference Channel with Unidirectional Transmitter Cooperation

Parthajit Mohapatra, Chandra R. Murthy, Jemin Lee

In this work, the role of unidirectional limited rate transmitter cooperation is studied in the case of the 2-user Z interference channel (Z-IC) with secrecy constraints at the receivers, on achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. The achievable schemes for the deterministic model use a fusion of cooperative precoding and transmission of a jamming signal. The optimality of the proposed scheme is established for the deterministic model for all possible parameter settings using the outer bounds derived by the authors in a previous work. Using the insights obtained from the deterministic model, a lower bound on the secrecy capacity region of the 2-user Gaussian Z-IC are obtained. The achievable scheme in this case uses stochastic encoding in addition to cooperative precoding and transmission of a jamming signal. The secure sum generalized degrees of freedom (GDOF) is characterized and shown to be optimal for the weak/moderate interference regime. It is also shown that the secure sum capacity lies within 2 bits/s/Hz of the outer bound for the weak/moderate interference regime for all values of the capacity of the cooperative link. Interestingly, in case of the deterministic model, it is found that there is no penalty on the capacity region of the Z-IC due to the secrecy constraints at the receivers in the weak/moderate interference regimes. Similarly, it is found that there is no loss in the secure sum GDOF for the Gaussian case due to the secrecy constraint at the receiver, in the weak/moderate interference regimes. The results highlight the importance of cooperation in facilitating secure communication over the Z-IC.

arXiv:1604.02442Apr 8, 20162 citations