Related papers: Security in The Gaussian Interference Channel: Wea…
We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…
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 cannot decode any meaningful information…
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…
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 K-user interference channel. In this paper, we introduce information…
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…
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…
In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the…
We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the…
In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel,…
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-IC with secrecy…
We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only…
Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely…
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…
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…
The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…
A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing…
The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel…
In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…
Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…
A $K$-user secure Gaussian Multiple-Access-Channel (MAC) with an external eavesdropper is considered in this paper. An achievable rate region is established for the secure discrete memoryless MAC. The secrecy sum capacity of the degraded…