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 International Symposium on Information Theory (ISIT)

Secure Communication Over 2-User Gaussian Interference Channel with Caching

Parthajit Mohapatra

Published Jun 26, 2022• 1 citation
Publisher

Abstract

This work explores the role of secure cache memory in improving the secrecy performance of the 2-user Gaussian symmetric interference channel (GSIC) with secrecy constraint. Receiver can store a function of files and secret keys with memory constraint. The encoded files sent over the GSIC are subject to eavesdropping by the unintended receiver. The work derives novel outer bound which takes account of the memory and secrecy constraint at the receiver. The work also presents novel achievable schemes and these schemes differ from each other based on the key used as a part of the cache and channel encoding process. The work illustrates the importance of partitioning the cache memory for data and key based on the scheme and strength of interference. The metric secure generalized degrees of freedom is used to illustrate the effectiveness of the derived results.

DOI
10.1109/isit50566.2022.9834617

Related papers

Role of Shared Key for Secure Communication Over 2-User Gaussian Z-Interference Channel

Uppalapati Somalatha, Parthajit Mohapatra

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-interference channel with secrecy constraint at the receiver is considered. The paper proposes novel achievable schemes, where the schemes differ from each other based on how the key has been used in the encoding process. The first achievable scheme uses a combination ofkey rate splitting,one-time pad,stochastic encodingandsuperposition coding. In this scheme, one part of the key is used for one-time pad and the remaining part of the key is used for stochastic encoding. The encoding is performed such that the receiver experiencing interference can decode some part of the interference without violating the secrecy constraint. As a special case of the derived result, one can obtain the secrecy rate region when the key is completely used for one-time pad or part of the stochastic encoding. The second scheme uses the shared key to encrypt the message using one-time pad and in contrast to the previous case no interference is decoded at the receiver. The paper also derives outer bound on the sum rate and secrecy rate. The main novelty of deriving outer bound lies in the selection of side information provided to the receiver and using the secrecy constraint. The derived outer bounds are found to be tight for certain channel conditions and rate of the key. The scaling behaviour of key rate is also explored for different schemes using the notion ofsecure generalized degrees of freedom. The optimality of different schemes are characterized for some specific cases. The developed results show the importance of key rate splitting in enhancing the secrecy performance of the system.

arXiv:2105.08975•IEEE Transactions on Information Forensics and Security•Dec 1, 2021•3 citations

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

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

Secure Degrees of Freedom of the Asymmetric Gaussian MIMO Interference Channel

Qiang Wang, Yi Wang, Haojin Wang

We study the secure degrees of freedom (s.d.o.f.) for a two-user multiple-input multiple-output (MIMO) Gaussian interference channel with confidential messages, each transmitter–receiver pair of which intends to keep secret from the other pair. Different from existing works on symmetric scenario, in this paper, an asymmetric system is considered, where transmitters have$M_1$,$M_2$antennas and receivers have$N_1$,$N_2$antennas, respectively. The channel is assumed to be fast fading and channel matrices are fixed and full rank. We subdivide the problem into several regimes based on the configuration of antennas at each node and present the exact secure degrees of freedom of corresponding regime. To prove a converse, the outer bound is developed by combining information theoretic derivation and the results of fundamental models. We also provide the achievable schemes based on zero forcing, real interference alignment, and cooperative jamming. One part of private signal is sent in the null space, while the other part is sent in a way that it aligns with cooperative jamming signal at unintended receiver, but leaves the secret message intact at intended receiver. As a consequence of the scheme, the objective s.d.o.f. can be achieved and the system ensures that the confidential messages cannot be eavesdropped by unintended receivers.

IEEE Transactions on Vehicular Technology•Mar 22, 2017•11 citations

Secure Degrees of Freedom of $K$ -User Gaussian Interference Channels: A Unified View

Jianwei Xie, Şennur Ulukuş

We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE); 2) K-user interference channel with confidential messages (IC-CM); and 3) K-user interference channel with confidential messages and one external eavesdropper (IC-CM-EE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K - 1)/(2K - 1). We show converses for IC-EE and IC-CM, which imply a converse for IC-CM-EE. We show achievability for IC-CM-EE, which implies achievability for IC-EE and IC-CM. Our converse is based on developing a direct relationship between the differential entropies of the channel inputs and the rates of the users, and quantifying the effect of eavesdropping on the rates in terms of the differential entropies of the eavesdroppers' observations. Our achievability is based on structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller subspace at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.

arXiv:1305.7214•IEEE Transactions on Information Theory•Mar 9, 2015•78 citations
This work explores the role of secure cache memory in improving the secrecy performance of the 2-user Gaussian symmetric interference channel (GSIC) with secrecy constraint. Receiver can store a function of files and secret keys with memory constraint. The encoded files sent over the GSIC are subject to eavesdropping by the unintended receiver. The work derives novel outer bound which takes account of the memory and secrecy constraint at the receiver. The work also presents novel achievable schemes and these schemes differ from each other based on the key used as a part of the cache and channel encoding process. The work illustrates the importance of partitioning the cache memory for data and key based on the scheme and strength of interference. The metric secure generalized degrees of freedom is used to illustrate the effectiveness of the derived results.
In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-interference channel with secrecy constraint at the receiver is considered. The paper proposes novel achievable schemes, where the schemes differ from each other based on how the key has been used in the encoding process. The first achievable scheme uses a combination ofkey rate splitting,one-time pad,stochastic encodingandsuperposition coding. In this scheme, one part of the key is used for one-time pad and the remaining part of the key is used for stochastic encoding. The encoding is performed such that the receiver experiencing interference can decode some part of the interference without violating the secrecy constraint. As a special case of the derived result, one can obtain the secrecy rate region when the key is completely used for one-time pad or part of the stochastic encoding. The second scheme uses the shared key to encrypt the message using one-time pad and in contrast to the previous case no interference is decoded at the receiver. The paper also derives outer bound on the sum rate and secrecy rate. The main novelty of deriving outer bound lies in the selection of side information provided to the receiver and using the secrecy constraint. The derived outer bounds are found to be tight for certain channel conditions and rate of the key. The scaling behaviour of key rate is also explored for different schemes using the notion ofsecure generalized degrees of freedom. The optimality of different schemes are characterized for some specific cases. The developed results show the importance of key rate splitting in enhancing the secrecy performance of the system.
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.
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 secure degrees of freedom (s.d.o.f.) for a two-user multiple-input multiple-output (MIMO) Gaussian interference channel with confidential messages, each transmitter–receiver pair of which intends to keep secret from the other pair. Different from existing works on symmetric scenario, in this paper, an asymmetric system is considered, where transmitters haveM1M_1M1​,M2M_2M2​antennas and receivers haveN1N_1N1​,N2N_2N2​antennas, respectively. The channel is assumed to be fast fading and channel matrices are fixed and full rank. We subdivide the problem into several regimes based on the configuration of antennas at each node and present the exact secure degrees of freedom of corresponding regime. To prove a converse, the outer bound is developed by combining information theoretic derivation and the results of fundamental models. We also provide the achievable schemes based on zero forcing, real interference alignment, and cooperative jamming. One part of private signal is sent in the null space, while the other part is sent in a way that it aligns with cooperative jamming signal at unintended receiver, but leaves the secret message intact at intended receiver. As a consequence of the scheme, the objective s.d.o.f. can be achieved and the system ensures that the confidential messages cannot be eavesdropped by unintended receivers.
Secure Degrees of Freedom of KKK -User Gaussian Interference Channels: A Unified View
We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE); 2) K-user interference channel with confidential messages (IC-CM); and 3) K-user interference channel with confidential messages and one external eavesdropper (IC-CM-EE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K - 1)/(2K - 1). We show converses for IC-EE and IC-CM, which imply a converse for IC-CM-EE. We show achievability for IC-CM-EE, which implies achievability for IC-EE and IC-CM. Our converse is based on developing a direct relationship between the differential entropies of the channel inputs and the rates of the users, and quantifying the effect of eavesdropping on the rates in terms of the differential entropies of the eavesdroppers' observations. Our achievability is based on structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller subspace at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.