English
Related papers

Related papers: The Secrecy Capacity of the MIMO Wiretap Channel

200 papers

In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword…

Information Theory · Computer Science 2017-01-25 Mohamed Nafea , Aylin Yener

This paper considers a scenario in which a source-destination pair needs to establish a confidential connection against an external eavesdropper, aided by the interference generated by another source-destination pair that exchanges public…

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

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed…

Information Theory · Computer Science 2015-03-19 Galen Reeves , Naveen Goela , Nebojsa Milosavljevic , Michael Gastpar

Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding…

Information Theory · Computer Science 2025-07-21 Shi-Yuan Wang , Matthieu R. Bloch

With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which…

Information Theory · Computer Science 2014-11-04 Maksym A. Girnyk , Frédéric Gabry , Mikko Vehkaperä , Lars K. Rasmussen , Mikael Skoglund

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a…

Information Theory · Computer Science 2016-11-17 Alessandro Biason , Nicola Laurenti , Michele Zorzi

Reliable and secure communication is an important aspect of modern fiber optic communication. In this work we consider a multi-mode fiber (MMF) channel wiretapped by an eavesdropper. We assume the transmitter knows the legitimate channel,…

Information Theory · Computer Science 2021-10-22 Eduard Jorswieck , Andrew Lonnstrom , Karl-Ludwig Besser , Stefan Rothe , Juergen W. Czarske

In this paper, we study the design of secure communication for time division duplex multi-cell multi-user massive multiple-input multiple-output (MIMO) systems with active eavesdropping. We assume that the eavesdropper actively attacks the…

Information Theory · Computer Science 2019-03-27 Yongpeng Wu , Chao-Kai Wen , Wen Chen , Shi Jin , Robert Schober , Giuseppe Caire

In this paper, we consider physical layer security provisioning in multi-cell massive multiple-input multiple-output (MIMO) systems. Specifically, we consider secure downlink transmission in a multi-cell massive MIMO system with…

Information Theory · Computer Science 2014-05-29 Jun Zhu , Robert Schober , Vijay K. Bhargava

This paper investigates artificial noise injection into the temporal and spatial dimensions of a legitimate wireless communication system to secure its transmissions from potential eavesdropping. We consider a multiple-input single-output…

Information Theory · Computer Science 2017-06-21 Ahmed El Shafie , Zhiguo Ding , Naofal Al-Dhahir

We prove the partial strong converse property for the discrete memoryless \emph{non-degraded} wiretap channel, for which we require the leakage to the eavesdropper to vanish but allow an asymptotic error probability $\epsilon \in [0,1)$ to…

Information Theory · Computer Science 2016-11-21 Yi-Peng Wei , Sennur Ulukus

Unmanned aerial vehicles (UAVs) are foreseen to constitute promising airborne communication devices as a benefit of their superior channel quality. But UAV-to-ground (U2G) communications are vulnerable to eavesdropping. Hence, we conceive a…

Information Theory · Computer Science 2022-07-12 Zhong Zheng , Xinyao Wang , Zesong Fei , Qingqing Wu , Bin Li , Lajos Hanzo

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck

The K-receiver wiretap channel is a channel model where a transmitter broadcasts K independent messages to K intended receivers while keeping them secret from an eavesdropper. The capacity region of the K-receiver multiple-input…

Information Theory · Computer Science 2023-04-04 Yue Qi , Mojtaba Vaezi , H. Vincent Poor

The wiretap channel model of Wyner is one of the first communication models with both reliability and security constraints. Capacity-achieving schemes for various models of the wiretap channel have received considerable attention in recent…

Information Theory · Computer Science 2016-11-04 Talha Cihad Gulcu , Alexander Barg

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2011-08-10 Igor Bjelaković , Holger Boche , Jochen Sommerfeld

We consider the communication scenario where K transmitters are each connected to a common receiver with an orthogonal noiseless link. One of the transmitters has a message for the receiver, who is prohibited from learning anything in the…

Information Theory · Computer Science 2018-04-05 Hua Sun

We study a wiretap channel model where the sender has $M$ transmit antennas and there are two groups consisting of $J_1$ and $J_2$ receivers respectively. Each receiver has a single antenna. We consider two scenarios. First we consider the…

Information Theory · Computer Science 2010-03-09 Ashish Khisti