In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it should remain ignorant regarding messages intended for other receivers. Our scheme relies on transmitters to collectively ensure the confidentiality of the transmitted messages using a cooperative jamming technique and lattice alignment. The Asymmetric compute-and-forward framework is used to perform the decoding operation. The proposed scheme is the first asymptotically optimal achievable scheme for this security scenario which scales to arbitrary number of users and works for any finite-valued SNR. Also, our scheme achieves the upper bound sum secure degrees of freedom of 1 without using external helpers and thus the achievable rates lie within constant gap from sum secure capacity.In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it should remain ignorant regarding messages intended for other receivers. Our scheme relies on transmitters to collectively ensure the confidentiality of the transmitted messages using a cooperative jamming technique and lattice alignment. The Asymmetric compute-and-forward framework is used to perform the decoding operation. The proposed scheme is the first asymptotically optimal achievable scheme for this security scenario which scales to arbitrary number of users and works for any finite-valued SNR. Also, our scheme achieves the upper bound sum secure degrees of freedom of 1 without using external helpers and thus the achievable rates lie within constant gap from sum secure capacity.

International Symposium on Information Theory and its ApplicationsOct 24, 20200 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.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 Communication over Interference Channel: To Jam or Not to Jam?

Jinyuan Chen

We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for any interference regimes.We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for any interference regimes.

Allerton Conference on Communication, Control, and ComputingOct 1, 201813 citations

Interference Channels with Confidential Messages: Scaling up the Secure Degrees of Freedom with No CSIT

Jean de Dieu Mutangana, Ravi Tandon

We consider the K-user interference channel with confidential messages (IC-CM) with intersymbol interference (ISI). The main contribution of this paper is to show that sum-secure degrees of freedom (SDoF) can be made to linearly increase with the number of users K with no channel state information at the transmitters (CSIT). We demonstrate that this is true whenever the channel impulse response (CIR) lengths from the legitimate transmitters towards their respectively intended receivers are larger than those from the interfering transmitters towards the unintended receivers. To design this scheme, we use: a) the simple channel matrix structures of the received signal space to eliminate interference and allow decodability at the intended receivers. b) an injection of artificial noise into the transmitted signal from a strategically chosen small number of transmitters that act as cooperative jammers in order to preserve confidentiality of messages at unintended receivers. This is the first work showing that the SDoF of the K-user IC-CM with ISI can linearly increase with K, the number of users.We consider the K-user interference channel with confidential messages (IC-CM) with intersymbol interference (ISI). The main contribution of this paper is to show that sum-secure degrees of freedom (SDoF) can be made to linearly increase with the number of users K with no channel state information at the transmitters (CSIT). We demonstrate that this is true whenever the channel impulse response (CIR) lengths from the legitimate transmitters towards their respectively intended receivers are larger than those from the interfering transmitters towards the unintended receivers. To design this scheme, we use: a) the simple channel matrix structures of the received signal space to eliminate interference and allow decodability at the intended receivers. b) an injection of artificial noise into the transmitted signal from a strategically chosen small number of transmitters that act as cooperative jammers in order to preserve confidentiality of messages at unintended receivers. This is the first work showing that the SDoF of the K-user IC-CM with ISI can linearly increase with K, the number of users.

Asilomar Conference on Signals, Systems and Computers (ACSSC)Oct 1, 20181 citation

Secure Communication over Interference Channel: To Jam or Not to Jam?

Jinyuan Chen

We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for all the interference regimes.We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for all the interference regimes.

arXiv:1810.13256Oct 30, 20181 citation

Secure Communication Over Interference Channel: To Jam or not to Jam?

Jinyuan Chen

We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for all the interference regimes, for almost all channel gains (except for a set of channel gains of measure zero).We consider a 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. For the symmetric case, this simple scheme is optimal when the interference-to-signal ratio (all link strengths in decibel scale) is no more than 2/3. However, when the ratio is more than 2/3, we show that this simple scheme is not optimal anymore and a scheme with cooperative jamming is proposed to achieve the optimal secure sum generalized degrees-of-freedom (GDoF). Specifically, for the symmetric case, we complete the optimal secure sum GDoF characterization for all the interference regimes, for almost all channel gains (except for a set of channel gains of measure zero).

IEEE Transactions on Information TheoryDec 24, 20199 citations

1

without using external helpers.