English
Related papers

Related papers: Secret-Key Capacity from MIMO Channel Probing

200 papers

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent, confidential messages and a common message. Each of the…

Information Theory · Computer Science 2016-11-17 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message…

Information Theory · Computer Science 2016-11-17 Hung D. Ly , Tie Liu , Yingbin Liang

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

Information theoretic secret key agreement is impossible without making initial assumptions. One type of initial assumption is correlated random variables that are generated by using a noisy channel that connects the terminals. Terminals…

Information Theory · Computer Science 2020-08-10 Alireza Poostindouz , Reihaneh Safavi-Naini

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

We investigate the secret key agreement from correlated vector Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show…

Information Theory · Computer Science 2011-09-29 Shun Watanabe , Yasutada Oohama

This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers…

Information Theory · Computer Science 2009-03-24 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate…

Quantum Physics · Physics 2025-12-18 Giuseppe Ortolano , Stefano Pirandola , Leonardo Banchi

We study the trade-off between secret message (SM) and secret key (SK) rates, simultaneously achievable over a state-dependent (SD) wiretap channel (WTC) with non-causal channel state information (CSI) at the encoder. This model subsumes…

Information Theory · Computer Science 2019-06-10 Alexander Bunin , Ziv Goldfeld , Haim H. Permuter , Shlomo Shamai , Paul Cuff , Pablo Piantanida

In this paper, we consider the transmission of confidential information over a $\kappa$-$\mu$ fading channel in the presence of an eavesdropper, who also observes $\kappa$-$\mu$ fading. In particular, we obtain novel analytical solutions…

Information Theory · Computer Science 2015-07-27 Nidhi Bhargav , Simon L. Cotton , David E. Simmons

The problem of Secret Key Establishment (SKE) over a pair of independent Discrete Memoryless Broadcast Channels (DMBCs) has already been studied in \cite{Ah10}, where we provided lower and upper bounds on the secret-key capacity. In this…

Information Theory · Computer Science 2010-04-27 Hadi Ahmadi , Reihaneh Safavi-Naini

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the…

Information Theory · Computer Science 2023-09-27 Yingbo Hua

We consider the strong secret key (SK) agreement problem for the satellite communication setting, where a satellite chooses a common binary phase shift keying modulated input for three statistically independent additive white Gaussian noise…

Information Theory · Computer Science 2021-08-31 Onur Günlü , Ueli Maurer , João Ribeiro

In this work, we consider a complete covert communication system, which includes the source-model of a stealthy secret key generation (SSKG) as the first phase. The generated key will be used for the covert communication in the second phase…

Information Theory · Computer Science 2017-03-01 Pin-Hsun Lin , Carsten Rudolf Janda , Eduard Axel Jorswieck

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical…

Information Theory · Computer Science 2014-01-16 Sanjay Vishwakarma , A. Chockalingam

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…

Information Theory · Computer Science 2016-06-14 Parthajit Mohapatra , Chandra R. Murthy