English
Related papers

Related papers: A Compressed Sensing Wire-Tap Channel

200 papers

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and…

Information Theory · Computer Science 2011-10-04 Aly El Gamal , O. Ozan Koyluoglu , Moustafa Youssef , Hesham El Gamal

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than…

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

We characterize the measurement complexity of compressed sensing of signals drawn from a known prior distribution, even when the support of the prior is the entire space (rather than, say, sparse vectors). We show for Gaussian measurements…

Machine Learning · Computer Science 2021-06-23 Ajil Jalal , Sushrut Karmalkar , Alexandros G. Dimakis , Eric Price

We consider the compressive sensing of a sparse or compressible signal ${\bf x} \in {\mathbb R}^M$. We explicitly construct a class of measurement matrices, referred to as the low density frames, and develop decoding algorithms that produce…

Information Theory · Computer Science 2009-03-05 Mehmet Akçakaya , Jinsoo Park , Vahid Tarokh

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

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

Recently, the secrecy capacity of the multi-antenna wiretap channel was characterized by Khisti and Wornell [1] using a Sato-like argument. This note presents an alternative characterization using a channel enhancement argument. This…

Information Theory · Computer Science 2007-10-23 Tie Liu , Shlomo Shamai

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…

Information Theory · Computer Science 2012-04-03 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , M. Reza Aref

A multi-input multi-output (MIMO) Gaussian channel with two transmit antennas and two receive antennas is studied that is subject to an input peak-power constraint. The capacity and the capacity-achieving input distribution are unknown in…

Information Theory · Computer Science 2024-01-31 Alex Dytso , Luca Barletta , Gerhard Kramer

We consider a fading wiretap channel model where the transmitter has only statistical channel state information, and the legitimate receiver and eavesdropper have perfect channel state information. We propose a sequence of non-random…

Information Theory · Computer Science 2016-11-18 Laura Luzzi , Cong Ling , Roope Vehkalahti

Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that…

Information Theory · Computer Science 2012-08-29 Gitta Kutyniok

This paper considers the problem of detecting a high dimensional signal (not necessarily sparse) based on compressed measurements with physical layer secrecy guarantees. First, we propose a collaborative compressive detection (CCD)…

Applications · Statistics 2015-02-19 Bhavya Kailkhura , Thakshila Wimalajeewa , Pramod K. Varshney

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

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

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase…

Optimization and Control · Mathematics 2016-12-30 Mateo Díaz , Mauricio Junca , Felipe Rincón , Mauricio Velasco

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

Information Theory · Computer Science 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

We consider the private classical capacity of a quantum wiretap channel, where the users (sender Alice, receiver Bob, and eavesdropper Eve) have access to the resource of a shared quantum state, additionally to their channel inputs and…

Quantum Physics · Physics 2024-09-25 Minglai Cai , Andreas Winter

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…

Information Theory · Computer Science 2015-03-20 Fan Cheng , Raymond W. Yeung , Kenneth W. Shum

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

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