English
Related papers

Related papers: Compute-and-Forward Can Buy Secrecy Cheap

200 papers

Compute-and-Forward is an emerging technique to deal with interference. It allows the receiver to decode a suitably chosen integer linear combination of the transmitted messages. The integer coefficients should be adapted to the channel…

Information Theory · Computer Science 2014-10-15 Saeid Sahraei , Michael Gastpar

Regenerating codes based on the approach of interference alignment for wireless interference channel achieve the cut-set bound for distributed storage systems. These codes provide data reliability, and perform efficient exact node repair…

Information Theory · Computer Science 2018-01-08 Natasa Paunkoska , Ninoslav Marina , Venceslav Kafedziski

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…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

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 available at the intended receiver is considered. The intended receiver is assumed to have a…

Information Theory · Computer Science 2011-10-18 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

-In this work, we focus on the K--user Gaussian Symmetric Complex-valued Interference Channels (GS-CIC). The Compute-and-Forward (CoF) protocol in wireless networks have been employed for Gaussian Symmetric Real-valued Interference Channels…

Information Theory · Computer Science 2016-05-11 Ehsan Ebrahimi Khaleghi , Jean-Claude Belfiore

Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The…

Information Theory · Computer Science 2011-06-14 Bobak Nazer , Michael Gastpar

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…

Information Theory · Computer Science 2011-09-27 Amin Jafarian , Sriram Vishwanath

We present a nested lattice-code-based strategy that achieves the random-coding based Compress-and-Forward (CF) rate for the three node Gaussian relay channel. To do so, we first outline a lattice-based strategy for the $(X+Z_1,X+Z_2)$…

Information Theory · Computer Science 2011-03-30 Yiwei Song , Natasha Devroye

In this paper, we investigate the physical-layer security for a spatial modulation (SM) based indoor visible light communication (VLC) system, which includes multiple transmitters, a legitimate receiver, and a passive eavesdropper (Eve). At…

Information Theory · Computer Science 2019-06-25 Jin-Yuan Wang , Hong Ge , Min Lin , Jun-Bo Wang , Jianxin Dai , Mohamed-Slim Alouini

We have developed a method to calculate a secret key rate of a continuous-variable quantum-key-distribution scheme using four coherent states and postselection for a general model of Gaussian attacks. We assume that the transmission line…

Quantum Physics · Physics 2018-10-30 Ryo Namiki , Akira Kitagawa , Takuya Hirano

This paper considers a cooperative jamming (CJ)-aided secure wireless communication system. Conventionally, the jammer transmits Gaussian noise (GN) to enhance security; however, the GN scheme also degrades the legitimate receiver's…

Information Theory · Computer Science 2025-10-08 Hao Yang , Hao Xu , Kai Wan , Sijie Zhao , Robert Caiming Qiu

In this paper, we propose a simultaneous secrecy and covert communications (SSACC) scheme in a reconfigurable intelligent surface (RIS)-aided network with a cooperative jammer. The scheme enhances communication security by maximizing the…

Signal Processing · Electrical Eng. & Systems 2026-05-01 Yanyu Cheng , Yujian Hu , Haoran Liu , Hua Zhong , Wei Wang , Pan Li

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…

Information Theory · Computer Science 2013-05-31 Jianwei Xie , Sennur Ulukus

We propose a simple yet complete lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves strong secret key rates up to 1/2 nat from the optimal in the case of…

Information Theory · Computer Science 2013-06-25 Cong Ling , Laura Luzzi , Matthieu R. Bloch

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

We propose a lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves the strong secret key capacity in the case of degraded source models, as well as the optimal…

Information Theory · Computer Science 2023-04-13 Laura Luzzi , Cong Ling , Matthieu R. Bloch

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…

Information Theory · Computer Science 2009-07-31 Xiang He , Aylin Yener

Due to the broadcast nature of wireless communications, physical layer security has always been a fundamental but challenging problem. Recent advance of Intelligent Reflecting Surface (IRS) introduces a new dimension for secure…

Signal Processing · Electrical Eng. & Systems 2020-10-29 Jian Li , Lan Zhang , Kaiping Xue , Yuguang Fang

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a…

Information Theory · Computer Science 2018-02-19 Tianyu Yang , Omid Taghizadeh , Rudolf Mathar

We consider the full-duplex two-way relay channel with direct link between two users and propose two coding schemes: a partial decode-forward scheme, and a combined decode-forward and compute-forward scheme. Both schemes use rate-splitting…

Information Theory · Computer Science 2011-08-19 Peng Zhong , Mai Vu