English
Related papers

Related papers: Adding a Helper Can Totally Remove the Secrecy Con…

200 papers

We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For…

Information Theory · Computer Science 2019-09-12 Jinyuan Chen , Chunhua Geng

In communication networks secrecy constraints usually incur an extra limit in capacity or generalized degrees-of-freedom (GDoF), in the sense that a penalty in capacity or GDoF is incurred due to the secrecy constraints. Over the past…

Information Theory · Computer Science 2019-07-11 Fan Li , Jinyuan Chen

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…

Information Theory · Computer Science 2018-11-01 Jinyuan Chen

We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental Gaussian network structures: wiretap channel, broadcast channel with confidential messages, interference channel with confidential…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

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 revisit the recent secure degrees of freedom (s.d.o.f.) results for one-hop multi-user wireless networks by considering three fundamental wireless network structures: Gaussian wiretap channel with helpers, Gaussian multiple access…

Information Theory · Computer Science 2015-07-09 Jianwei Xie , Sennur Ulukus

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…

Information Theory · Computer Science 2016-11-17 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

In this paper, we investigate the generalized degrees-of-freedom (GDoF) of the asymmetric interference channel with delayed channel state information at the transmitter (CSIT), where each transmitter has two antennas, each receiver has one…

Information Theory · Computer Science 2022-05-04 Tong Zhang , Yufan Zhuang , Yinfei Xu

In wireless networks, link strengths are often affected by some topological factors such as propagation path loss, shadowing and inter-cell interference. Thus, different users in the network might experience different link strengths. In…

Information Theory · Computer Science 2019-10-30 Jinyuan Chen

The symmetric K user interference channel with fully connected topology is considered, in which (a) each receiver suffers interference from all other (K-1) transmitters, and (b) each transmitter has causal and noiseless feedback from its…

Information Theory · Computer Science 2012-12-24 Soheil Mohajer , Ravi Tandon , H. Vincent Poor

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using…

Information Theory · Computer Science 2016-11-15 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

The Generalized Degrees of Freedom (GDoF) of the two user interference channel are characterized for all parameter regimes under the assumption of finite precision channel state information at the transmitters (CSIT), when a limited amount…

Information Theory · Computer Science 2019-08-05 Junge Wang , Bofeng Yuan , Lexiang Huang , Syed A. Jafar

Handling interference is one of the main challenges in the design of wireless networks. In this paper we study the application of cooperation for interference management in the weak interference (WI) regime, focusing on the Z-interference…

Information Theory · Computer Science 2017-03-08 Daniel Zahavi , Ron Dabora

We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI…

Information Theory · Computer Science 2013-02-27 Jianwei Xie , Sennur Ulukus

In this paper, the $K$-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the…

Information Theory · Computer Science 2020-01-08 Mohamed Seif , Ravi Tandon , Ming Li

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…

Information Theory · Computer Science 2016-06-14 Parthajit Mohapatra , Chandra R. Murthy

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…

Information Theory · Computer Science 2015-03-17 Xiang He , Aylin Yener

The generalized degrees of freedom (GDoF) region of the multiple-input multiple-output (MIMO) Gaussian Z-interference channel with an arbitrary number of antennas at each node is established under the assumption of delayed channel state…

Information Theory · Computer Science 2016-05-04 Kaniska Mohanty , Mahesh K. Varanasi

This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…

Information Theory · Computer Science 2013-01-29 Diana Maamari , Daniela Tuninetti , Natasha Devroye

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

Information Theory · Computer Science 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy
‹ Prev 1 2 3 10 Next ›