Related papers: Compute-and-Forward Can Buy Secrecy Cheap
In this paper, we consider a Gaussian two-way relay channel (GTRC), where two sources exchange messages with each other through a relay. We assume that there is no direct link between sources, and all nodes operate in full-duplex mode. By…
In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…
Recent results on source-channel coding for secure transmission show that separation holds in several cases under some less-noisy conditions. However, it has also been proved through a simple counterexample that pure analog schemes can be…
Compute-forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions…
We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…
In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…
Interference Alignment is a new solution to over- come the problem of interference in multiuser wireless com- munication systems. Recently, the Compute-and-Forward (CF) transform has been proposed to approximate the capacity of K- user…
In this paper, we investigate secure communications in uplink transmissions, where there are a base station (BS) with M receive antennas, K mobile users each with a single antenna, and an eavesdropper with N receive antennas. The…
We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…
The problem of secure communication in Amplify-and-Forward (AF) relay networks with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a…
This paper proposes a new scheme to enhance the secrecy performance of a NOMA-based coordinated direct relay transmission system (NOMA-CDRT) with an untrusted relay. The physical-layer network coding and the non-orthogonal multiple access…
We examine the benefits of user cooperation under compute-and-forward. Much like in network coding, receivers in a compute-and-forward network recover finite-field linear combinations of transmitters' messages. Recovery is enabled by linear…
This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes.…
This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are…
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…
In this work, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels.…
We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably…
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 work we study encoding/decoding schemes for the transmission of a discrete time analog Gaussian source over a Gaussian wiretap channel. The intended receiver is assumed to have a certain minimum signal to noise ratio (SNR) and the…
The paper studies a class of three user Gaussian interference channels. A new layered lattice coding scheme is introduced as a transmission strategy. The use of lattice codes allows for an "alignment" of the interference observed at each…