English
Related papers

Related papers: Interference Alignment for Secrecy

200 papers

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

The paper establishes the optimal generalized degrees of freedom (GDOF) of 3-user $M \times N$ multiple-input multiple-output (MIMO) Gaussian interference channel (GIC) in which each transmitter has $M$ antennas and each receiver has $N$…

Information Theory · Computer Science 2012-08-29 Jung Hyun Bae , Jungwon Lee , Inyup Kang

In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…

Information Theory · Computer Science 2018-10-03 Long Kong , Satyanarayana Vuppala , Georges Kaddoum

We study a four terminal parallel relay-eavesdropper channel which consists of multiple independent relay-eavesdropper channels as subchannels. For the discrete memoryless case, we establish inner and outer bounds on the rate-equivocation…

Information Theory · Computer Science 2010-11-10 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

We provide innerbound and outerbound for the total number of degrees of freedom of the $K$ user multiple input multiple output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver if…

Information Theory · Computer Science 2008-09-02 Tiangao Gou , Syed A. Jafar

An interference alignment example is constructed for the deterministic channel model of the $K$ user interference channel. The deterministic channel example is then translated into the Gaussian setting, creating the first known example of a…

Information Theory · Computer Science 2007-11-19 Viveck Cadambe , Syed A. Jafar , Shlomo Shamai

This paper establishes the utility of user cooperation in facilitating secure wireless communications. In particular, the four-terminal relay-eavesdropper channel is introduced and an outer-bound on the optimal rate-equivocation region is…

Information Theory · Computer Science 2007-07-13 Lifeng Lai , Hesham El Gamal

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

Information Theory · Computer Science 2008-12-02 Ersen Ekrem , Sennur Ulukus

In this paper, we consider multiple-antenna $K$-user interference channels with backhaul collaboration in one side (among the transmitters or among the receivers) and investigate the trade-off between the rate in the channel versus the…

Information Theory · Computer Science 2018-07-24 Borna Kananian , Mohammad Ali Maddah-ali , Babak Hossein Khalaj

Consider a K-user flat fading MIMO interference channel where the k-th transmitter (or receiver) is equipped with M_k (respectively N_k) antennas. If a large number of statistically independent channel extensions are allowed either across…

Information Theory · Computer Science 2015-05-27 Meisam Razaviyayn , Gennady Lyubeznik , Zhi-Quan Luo

A combined technique of interference alignment (IA) and interference cancellation (IC), known as interference alignment and cancellation (IAC) scheme, has been proposed to improve the total achievable degrees of freedom (DoFs) over IA.…

Signal Processing · Electrical Eng. & Systems 2019-08-02 Qu Xin , Chung G. Kang

It was shown recently that the 2-user interference channel with a cognitive relay (IC-CR) has full degrees of freedom (DoF) almost surely, that is, 2 DoF. The purpose of this work is to check whether the DoF of the $K$-user IC-CR,…

Information Theory · Computer Science 2012-07-03 Anas Chaaban , Aydin Sezgin

We study the Gaussian MIMOME wiretap channel where a transmitter wishes to communicate a confidential message to a legitimate receiver in the presence of eavesdroppers, while the eavesdroppers should not be able to decode the confidential…

Information Theory · Computer Science 2016-03-08 Sina Lashgari , Amir Salman Avestimehr

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…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

This paper investigates the achievable total degrees of freedom (DoF) of the MIMO multi-way relay channel that consists of K users, where each user is equipped with M antennas, and a decode-and-forward relay equipped with N antennas. In…

Information Theory · Computer Science 2016-11-15 Mohamed Salah , Amr El-Keyi , Yahya Mohasseb , Mohammed Nafie

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable…

Information Theory · Computer Science 2013-12-12 Mahtab Mirmohseni , Panagiotis Papadimitratos

The topological interference management (TIM) problem refers to the study of the K-user partially connected interference networks with no channel state information at the transmitters (CSIT), except for the knowledge of network topology. In…

Information Theory · Computer Science 2023-01-31 Jean de Dieu Mutangana , Ravi Tandon

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…

Information Theory · Computer Science 2016-05-19 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , Mohammad Reza Aref