English
Related papers

Related papers: Optimal Signaling for Secure Communications over G…

200 papers

The General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT) and the Gaussian Two-Way Wire-Tap Channel (GTW-WT) are considered. In the GGMAC-WT, multiple users communicate with an intended receiver in the presence of an eavesdropper who…

Information Theory · Computer Science 2008-01-28 Ender Tekin , Aylin Yener

We investigate the optimality and power allocation algorithm of beam domain transmission for single-cell massive multiple-input multiple-output (MIMO) systems with a multi-antenna passive eavesdropper. Focusing on the secure massive MIMO…

Information Theory · Computer Science 2018-01-10 Wenqian Wu , Xiqi Gao , Yongpeng Wu , Chengshan Xiao

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

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

This paper studies the capacity of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channels with multiple eavesdroppers having single/multiple antennas. It is known that the MIMO secrecy capacity is achievable with the…

Information Theory · Computer Science 2009-02-02 Lan Zhang , Rui Zhang , Ying-Chang Liang , Yan Xin , Shuguang Cui

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

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

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

A fully general approach to the security analysis of continuous-variable quantum key distribution (CV-QKD) is presented. Provided that the quantum channel is estimated via the covariance matrix of the quadratures, Gaussian attacks are shown…

Quantum Physics · Physics 2009-11-13 Raul Garcia-Patron , Nicolas J. Cerf

End-to-end learning of communication systems with neural networks and particularly autoencoders is an emerging research direction which gained popularity in the last year. In this approach, neural networks learn to simultaneously optimize…

Information Theory · Computer Science 2019-03-12 Rick Fritschek , Rafael F. Schaefer , Gerhard Wunder

A wiretap channel is served as the fundamental model of physical layer security techniques, where the secrecy capacity of the Gaussian wiretap channel is proven to be achieved by Gaussian input. However, there remains a gap between the…

Information Theory · Computer Science 2024-11-12 Li Shen , Yongpeng Wu , Peihong Yuan , Chengshan Xiao , Xiang-Gen Xia , Wenjun Zhang

We consider the problem of selecting $k_t \times k_r$ antennas from a Gaussian MIMO channel with $n_t \times n_r$ antennas, where $k_t \leq n_t$ and $k_r \leq n_r$. We prove the following two results that hold universally, in the sense that…

Information Theory · Computer Science 2016-08-17 Yahya H. Ezzeldin , Ayan Sengupta , Christina Fragouli

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…

Information Theory · Computer Science 2016-07-18 Tulika Agrawal , Samar Agnihotri

Presence of multiple antennas on both sides of a communication channel promises significant improvements in system throughput and power efficiency. In effect, a new class of large multiple-input multiple-output (MIMO) communication systems…

Information Theory · Computer Science 2014-01-28 Maksym A. Girnyk , Mikko Vehkaperä , Lars K. Rasmussen

This paper considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna eavesdroppers. We assume that the transmitter has perfect…

Information Theory · Computer Science 2011-04-22 Qiang Li , Wing-Kin Ma

We introduce the problem of communication with partial information, where there is an asymmetry between the transmitter and the receiver codebooks. Practical applications of the proposed setup include the robust signal hashing problem…

Information Theory · Computer Science 2009-10-29 Onur Ozyesil , M. Kivanc Mihcak , Yucel Altug

We have evaluated the optimal secrecy rate for Amplify-and-Forward (AF) relay networks with multiple eavesdroppers. Assuming i.i.d. Gaussian noise at the destination and the eavesdroppers, we have devised technique to calculate optimal…

Information Theory · Computer Science 2014-06-02 Siddhartha Sarma , Samar Agnihotri , Joy Kuri

Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or…

Information Theory · Computer Science 2013-10-03 Zhen Qu , Shengli Zhang , Mingjun Dai , Hui Wang

Recently proposed multiple input multiple output radars based on matrix completion (MIMO-MC) employ sparse sampling to reduce the amount of data that need to be forwarded to the radar fusion center, and as such enable savings in…

Information Theory · Computer Science 2016-08-24 Bo Li , Athina P. Petropulu , Wade Trappe

Inverse probability problems whose generative models are given by strictly nonlinear Gaussian random fields show the all-or-nothing behavior: There exists a critical rate at which Bayesian inference exhibits a phase transition. Below this…

Information Theory · Computer Science 2022-05-19 Ali Bereyhi , Bruno Loureiro , Florent Krzakala , Ralf R. Müller , Hermann Schulz-Baldes

Minimax detection of Gaussian stochastic sequences (signals) with unknown covariance matrices is studied. For a fixed false alarm probability (1-st kind error probability), the performance of the minimax detection is being characterized by…

Information Theory · Computer Science 2021-04-14 M. V. Burnashev