English
Related papers

Related papers: Multiple Antenna Secure Broadcast over Wireless Ne…

200 papers

One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the…

Information Theory · Computer Science 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

Information Theory · Computer Science 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic

Covert communication hides the transmission of a message from a watchful adversary while ensuring reliable information decoding at the receiver, providing enhanced security in wireless communications. In this letter, covert communication in…

Information Theory · Computer Science 2019-10-17 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…

Information Theory · Computer Science 2020-08-04 Hassan ZivariFard , Matthieu Bloch , Aria Nosratinia

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the…

Information Theory · Computer Science 2017-07-20 Chao Qi , Bin Dai , Xiaohu Tang

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by…

Information Theory · Computer Science 2016-11-17 Shabnam Shafiee , Nan Liu , Sennur Ulukus

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple…

Information Theory · Computer Science 2007-08-31 Ashish Khisti , Gregory Wornell

We formulate and study a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob…

Information Theory · Computer Science 2011-10-27 László Czap , Vinod M. Prabhakaran , Suhas Diggavi , Christina Fragouli

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna…

Information Theory · Computer Science 2016-11-15 Shafi Bashar , Zhi Ding , Chengshan Xiao

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the…

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

This paper considers the secrecy performance of several schemes for multi-antenna transmission to single-antenna users with full-duplex (FD) capability against randomly distributed single-antenna eavesdroppers (EDs). These schemes and…

Information Theory · Computer Science 2025-07-21 Ishmam Zabir , Ahmed Maksud , Gaojie Chen , Brian M. Sadler , Yingbo Hua

In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static…

Information Theory · Computer Science 2007-07-13 Matthieu Bloch , Joao Barros , Miguel R. D. Rodrigues , Steven W. McLaughlin

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