Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Globecom Workshops (GC Wkshps)

Secure 2-User Gaussian Interference Channel with Limited Information Exchange at the Transmitters

Andrea Matera, Pin-Hsun Lin, Eduard Axel Jorswieck, Umberto Spagnolini

Published Dec 1, 2016• 0 citations
Publisher

Abstract

This paper considers the interference-mitigation cooperation over a secure 2-user Gaussian Interference Channel with Limited Information Exchange at the Transmitters (GIC-LIET) over an infinite rate link between the two transmitters. The information exchange between the transmitters enables the precoding based on Block- Diagonalization and the privacy constrains the messages of one transmitter to be kept confidential for the other transmitter, as well as the other receiver. The privacy constraint is guaranteed by a wiretap coding. Based on the assumption of the infinite rate link between the two transmitters, we inject artificial noise at each of the two transmitters such that the received signal at the potential eavesdroppers (i.e., the other transmitter and receiver) is a degraded version of the signal received at the desired receiver. The secrecy rate region of the proposed GIC-LIET is derived and compared to two extreme cases: no information exchange at all and full information exchange at the transmitters. Numerical results prove that the secrecy rate region of the proposed scheme is in between the performance of the two competitors providing a good trade-off between the amount of information exchanged and the achievable secrecy rates.

DOI
10.1109/glocomw.2016.7849039

Related papers

On the Secrecy Capacity of 2-user Gaussian Interference Channel with Independent Secret Keys

Aditya Sinha, Parthajit Mohapatra, Jemin Lee +1 more

This paper considers the problem of secure communication over a 2-user Gaussian interference channel (GIC) with shared key of finite rate between the transmitter-receiver pair with strong secrecy constraint at the receiver. The main contributions of the paper lies in obtaining a novel achievable scheme which uses a combination of one-time pad, stochastic encoding and superposition based coding scheme, and outer bound on the secrecy capacity region of the 2-user GIC. The main novelty of the derivation of the outer bound lies in the selection of the side-information to be provided to the receiver and using the secrecy constraints at the receiver. The results highlight the role of secret key in the encoding of messages to enhance the system performance in interference limited scenarios.

International Symposium on Information Theory and its Applications•Oct 1, 2018•2 citations

MIMO Interference Channel With Confidential Messages: Achievable Secrecy Rates and Precoder Design

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

We study the achievable rate regions of the multiple-input multiple-output (MIMO) interference channel with confidential messages sent to two receivers, assuming the transmitters use linear precoding. Each receiver is assumed to be an eavesdropper for the other link, and the transmitters employ various techniques to increase the secrecy rate of their own link or that of the network. We describe both cooperative and noncooperative transmission schemes for Gaussian interference channels, and derive their achievable secrecy rate regions. Cooperation is made possible if the transmitters share a portion of their channel state information, allowing them to appropriately adjust their precoders and improve the overall secrecy performance of the network. A game-theoretic formulation of the problem is adopted to allow the transmitters to find an operating point that balances network performance and fairness. The benefit of cooperation is demonstrated via several numerical examples.

IEEE Transactions on Information Forensics and Security•May 20, 2011•63 citations

On the Secrecy Capacity Region of the Two-User Symmetric Z Interference Channel With Unidirectional Transmitter Cooperation

Parthajit Mohapatra, Chandra R. Murthy, Jemin Lee

In this paper, the role of unidirectional limited rate transmitter cooperation is studied for the two-user symmetric Z interference channel (Z-IC) with secrecy constraints at the receivers, in achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. A novel scheme for partitioning the encoded messages and outputs based on the relative strengths of the signal and interference is proposed. The partitioning reveals the side information that needs to be provided to the receiver and facilitates the development of tight outer bounds on the secrecy capacity region. 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. The insights obtained from the deterministic model are used to derive inner and outer bounds on the secrecy capacity region of the two-user Gaussian symmetric Z-IC. The achievable scheme for the Gaussian model uses stochastic encoding in addition to cooperative precoding and transmission of a jamming signal. For the Gaussian case, 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 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.02442•IEEE Transactions on Information Forensics and Security•Oct 26, 2016•10 citations

On the Capacity of the Two-User Symmetric Interference Channel With Transmitter Cooperation and Secrecy Constraints

Parthajit Mohapatra, Chandra R. Murthy

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the two-user Gaussian symmetric interference channel (IC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model parameters. Outer bounds on the secrecy rate are also derived, using a novel partitioning of the encoded messages and outputs depending on the relative strength of the signal and the interference. The partitioning helps to bound certain negative entropy terms, leading to a tractable outer bound. The inner and outer bounds are derived under all possible parameter settings. It is found that, for some parameter settings, the inner and outer bounds match, yielding the capacity of the SLDIC under transmitter cooperation and secrecy constraints. In some other scenarios, the achievable rate matches with the capacity region of the two-user SLDIC without secrecy constraints derived by Wang and Tse; thus, the proposed scheme offers secrecy for free, in these cases. Inspired by the achievable schemes and outer bounds in the deterministic case, achievable schemes and outer bounds are derived in the Gaussian case. The proposed achievable scheme for the Gaussian case is based on Marton's coding scheme and stochastic encoding along with dummy message transmission. One of the key techniques used in the achievable scheme for both the models is interference cancelation, which simultaneously offers two seemingly conflicting benefits: it cancels interference and ensures secrecy. Many of the results derived in this paper extend to the asymmetric case also. The results show that limited transmitter cooperation can greatly facilitate secure communications over two-user ICs.

arXiv:1402.5359•IEEE Transactions on Information Theory•Jul 20, 2016•18 citations

MIMO interference channel with confidential messages: Game theoretic beamforming designs

S. Ali. A. Fakoorian, Arnold Lee Swindlehurst

We study the achievable rate regions of the multiple-input multiple-output (MIMO) interference channel with confidential messages sent to two receivers. Under this model, each receiver is an eavesdropper for the other link and tries to decode both its own message and the message intended for the other receiver. We describe several transmission schemes for Gaussian interference channels and derive their achievable secrecy rate regions under the assumption that the transmitters use low complexity beamforming algorithms. We also consider the trade-offs associated with their need for channel state information at the transmitter (CSIT).We approach the above topics from a game-theoretic perspective.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2010•10 citations

The interference wiretap channel with an arbitrarily varying eavesdropper: Aligning interference with artificial noise

Xiang He, Aylin Yener

In this work, a Gaussian two-user MIMO interference channel is considered in the presence of an external eavesdropper whose channel is completely unknown to the legitimate communication parties and can be varying in an arbitrary fashion from one channel use to the next. We improve our recent result by deriving a larger achievable secrecy degrees of freedom region. In the achievable scheme, the transmitter injects artificial noise to confuse the eavesdropper, and at the same time aligns the injected noise with the interference from the other user at the intended receiver. The achieved secure degrees of freedom are shown to be closely connected to the rank of the effective channel matrix through which the eavesdropper observes the artificial noise. The precoding matrix is then designed to ensure that this rank cannot be reduced under any possible Eve's channel state.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2012•8 citations
This paper considers the interference-mitigation cooperation over a secure 2-user Gaussian Interference Channel with Limited Information Exchange at the Transmitters (GIC-LIET) over an infinite rate link between the two transmitters. The information exchange between the transmitters enables the precoding based on Block- Diagonalization and the privacy constrains the messages of one transmitter to be kept confidential for the other transmitter, as well as the other receiver. The privacy constraint is guaranteed by a wiretap coding. Based on the assumption of the infinite rate link between the two transmitters, we inject artificial noise at each of the two transmitters such that the received signal at the potential eavesdroppers (i.e., the other transmitter and receiver) is a degraded version of the signal received at the desired receiver. The secrecy rate region of the proposed GIC-LIET is derived and compared to two extreme cases: no information exchange at all and full information exchange at the transmitters. Numerical results prove that the secrecy rate region of the proposed scheme is in between the performance of the two competitors providing a good trade-off between the amount of information exchanged and the achievable secrecy rates.
This paper considers the problem of secure communication over a 2-user Gaussian interference channel (GIC) with shared key of finite rate between the transmitter-receiver pair with strong secrecy constraint at the receiver. The main contributions of the paper lies in obtaining a novel achievable scheme which uses a combination of one-time pad, stochastic encoding and superposition based coding scheme, and outer bound on the secrecy capacity region of the 2-user GIC. The main novelty of the derivation of the outer bound lies in the selection of the side-information to be provided to the receiver and using the secrecy constraints at the receiver. The results highlight the role of secret key in the encoding of messages to enhance the system performance in interference limited scenarios.
We study the achievable rate regions of the multiple-input multiple-output (MIMO) interference channel with confidential messages sent to two receivers, assuming the transmitters use linear precoding. Each receiver is assumed to be an eavesdropper for the other link, and the transmitters employ various techniques to increase the secrecy rate of their own link or that of the network. We describe both cooperative and noncooperative transmission schemes for Gaussian interference channels, and derive their achievable secrecy rate regions. Cooperation is made possible if the transmitters share a portion of their channel state information, allowing them to appropriately adjust their precoders and improve the overall secrecy performance of the network. A game-theoretic formulation of the problem is adopted to allow the transmitters to find an operating point that balances network performance and fairness. The benefit of cooperation is demonstrated via several numerical examples.
In this paper, the role of unidirectional limited rate transmitter cooperation is studied for the two-user symmetric Z interference channel (Z-IC) with secrecy constraints at the receivers, in achieving two conflicting goals simultaneously: mitigating interference and ensuring secrecy. First, the problem is studied under the linear deterministic model. A novel scheme for partitioning the encoded messages and outputs based on the relative strengths of the signal and interference is proposed. The partitioning reveals the side information that needs to be provided to the receiver and facilitates the development of tight outer bounds on the secrecy capacity region. 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. The insights obtained from the deterministic model are used to derive inner and outer bounds on the secrecy capacity region of the two-user Gaussian symmetric Z-IC. The achievable scheme for the Gaussian model uses stochastic encoding in addition to cooperative precoding and transmission of a jamming signal. For the Gaussian case, 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 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.
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the two-user Gaussian symmetric interference channel (IC). First, the problem is studied in the symmetric linear deterministic IC (SLDIC) setting, and achievable schemes are proposed, based on interference cancelation, relaying of the other user's data bits, and transmission of random bits. In the proposed achievable scheme, the limited rate cooperative link is used to share a combination of data bits and random bits depending on the model parameters. Outer bounds on the secrecy rate are also derived, using a novel partitioning of the encoded messages and outputs depending on the relative strength of the signal and the interference. The partitioning helps to bound certain negative entropy terms, leading to a tractable outer bound. The inner and outer bounds are derived under all possible parameter settings. It is found that, for some parameter settings, the inner and outer bounds match, yielding the capacity of the SLDIC under transmitter cooperation and secrecy constraints. In some other scenarios, the achievable rate matches with the capacity region of the two-user SLDIC without secrecy constraints derived by Wang and Tse; thus, the proposed scheme offers secrecy for free, in these cases. Inspired by the achievable schemes and outer bounds in the deterministic case, achievable schemes and outer bounds are derived in the Gaussian case. The proposed achievable scheme for the Gaussian case is based on Marton's coding scheme and stochastic encoding along with dummy message transmission. One of the key techniques used in the achievable scheme for both the models is interference cancelation, which simultaneously offers two seemingly conflicting benefits: it cancels interference and ensures secrecy. Many of the results derived in this paper extend to the asymmetric case also. The results show that limited transmitter cooperation can greatly facilitate secure communications over two-user ICs.
We study the achievable rate regions of the multiple-input multiple-output (MIMO) interference channel with confidential messages sent to two receivers. Under this model, each receiver is an eavesdropper for the other link and tries to decode both its own message and the message intended for the other receiver. We describe several transmission schemes for Gaussian interference channels and derive their achievable secrecy rate regions under the assumption that the transmitters use low complexity beamforming algorithms. We also consider the trade-offs associated with their need for channel state information at the transmitter (CSIT).We approach the above topics from a game-theoretic perspective.
In this work, a Gaussian two-user MIMO interference channel is considered in the presence of an external eavesdropper whose channel is completely unknown to the legitimate communication parties and can be varying in an arbitrary fashion from one channel use to the next. We improve our recent result by deriving a larger achievable secrecy degrees of freedom region. In the achievable scheme, the transmitter injects artificial noise to confuse the eavesdropper, and at the same time aligns the injected noise with the interference from the other user at the intended receiver. The achieved secure degrees of freedom are shown to be closely connected to the rank of the effective channel matrix through which the eavesdropper observes the artificial noise. The precoding matrix is then designed to ensure that this rank cannot be reduced under any possible Eve's channel state.