English
Related papers

Related papers: Improving Wireless Physical Layer Security via Exp…

200 papers

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix…

Information Theory · Computer Science 2012-03-08 Xiang He , Ashish Khisti , Aylin Yener

We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As…

Information Theory · Computer Science 2016-11-15 Xiang He , Ashish Khisti , Aylin Yener

We investigate the secure degrees of freedom (SDoF) of the K-user MIMO multiple access (MAC) and the two user MIMO interference channel. An unknown number of eavesdroppers are trying to decode the messages sent by the transmitters. Each…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

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

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

In this paper, a multiple antenna wire-tap channel in the presence of a multi-antenna cooperative jammer is studied. In particular, the secure degrees of freedom (s.d.o.f.) of this channel is established, with $N_t$ antennas at the…

Information Theory · Computer Science 2015-12-24 Mohamed Nafea , Aylin Yener

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

The secrecy degrees of freedom (SDoF) of the Gaussian multiple-input and single-output (MISO) wiretap channel is studied under the assumption that delayed channel state information (CSI) is available at the transmitter and each receiver…

Information Theory · Computer Science 2011-08-09 Sheng Yang , Pablo Piantanida , Mari Kobayashi , Shlomo Shamai

The multiple-input multiple-output (MIMO) wiretap interference channel (IC) serves as a canonical model for information-theoretic security, where a multiple-antenna eavesdropper attempts to intercept communications in a two-user MIMO IC…

Information Theory · Computer Science 2025-06-24 Linfan Su , Yuhang Miao , Yuxuan Song , Shuo Zheng , Tong Zhang , Yinfei Xu , Shuai Wang , Na Li

We consider linear precoder design for a multiple-input multiple-output (MIMO) Gaussian wiretap channel, which comprises two legitimate nodes, i.e., Alice and Bob, operating in Full-Duplex (FD) mode and exchanging confidential messages in…

Information Theory · Computer Science 2016-11-16 Lingxiang Li , Zhi Chen , A. P. Petropulu , Jun Fang

We consider the multi-antenna wiretap channel in which the transmitter wishes to send a confidential message to its receiver while keeping it secret to the eavesdropper. It has been known that the secrecy capacity of such a channel does not…

Information Theory · Computer Science 2016-11-17 Mari Kobayashi , Pablo Piantanida , Sheng Yang , Shlomo Shamai

We consider a two-user multiple-input multiple-output (MIMO) multiple access wiretap channel with $N$ antennas at each transmitter, $N$ antennas at the legitimate receiver, and $K$ antennas at the eavesdropper. We determine the optimal sum…

Information Theory · Computer Science 2016-04-13 Pritam Mukherjee , 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

We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown $\tfrac{2}{3}$ secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access…

Information Theory · Computer Science 2017-01-26 Rick Fritschek , Gerhard Wunder

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

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…

Information Theory · Computer Science 2010-03-04 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This paper considers a scenario in which an Alice-Bob pair wishes to communicate in secret in the presence of an active Eve, who is capable of jamming as well as eavesdropping in Full-Duplex (FD) mode. As countermeasure, Bob also operates…

Information Theory · Computer Science 2016-12-07 Lingxiang Li , Athina P. Petropulu , Zhi Chen

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

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

This paper studies secrecy rate optimization in a wireless network with a single-antenna source, a multi-antenna destination and a multi-antenna eavesdropper. This is an unfavorable scenario for secrecy performance as the system is…

Information Theory · Computer Science 2016-08-24 Gan Zheng , Ioannis Krikidis , Jiangyuan Li , Athina P. Petropulu , Bjorn Ottersten
‹ Prev 1 2 3 10 Next ›