English
Related papers

Related papers: Secret Sharing over Fast-Fading MIMO Wiretap Chann…

200 papers

This paper discusses the characteristics of a space-to-space multiple-input, multiple-output (MIMO) communication channel that distinguish it from more common terrestrial MIMO communication channels. These characteristics imply that the…

Information Theory · Computer Science 2016-01-21 Richard J. Barton

Massive MIMO is a new technique for wireless communications that claims to offer very high system throughput and energy efficiency in multi-user scenarios. The cost is to add a very large number of antennas at the base station. Theoretical…

Information Theory · Computer Science 2015-07-23 Àlex Oliveras Martínez , Elisabeth De Carvalho , Jesper Ødum Nielsen

This work proposes a novel joint design for multiuser multiple-input multiple-output wiretap channels. The base station exploits a switching network to connect a subset of its antennas to the available radio frequency chains. The switching…

Signal Processing · Electrical Eng. & Systems 2024-11-05 Zhenqiao Cheng , Nanxi Li , Ruizhe Long , Jianchi Zhu , Chongjun Ouyang , Peng Chen

Motivated by MIMO broad-band fading channel model, in this section we deals with the capacity behaviour of wireless MIMO and OFDM based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown…

Networking and Internet Architecture · Computer Science 2010-06-07 Nirmalendu Bikas Sinha , Prosenjit kumar , M. Mitra

We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and…

Information Theory · Computer Science 2010-05-05 Ersen Ekrem , Sennur Ulukus

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 studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically or not. To address this question, the concept of Turing…

Information Theory · Computer Science 2025-01-22 Holger Boche , Andrea Grigorescu , Rafael F. Schaefer , H. Vincent Poor

Wireless covert channels promise to exfiltrate information with high bandwidth by circumventing traditional access control mechanisms. Ideally, they are only accessible by the intended recipient and---for regular system…

Networking and Internet Architecture · Computer Science 2015-05-06 Jiska Classen , Matthias Schulz , Matthias Hollick

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

Reliability is becoming increasingly important for many applications envisioned for future wireless systems. A technology that could improve reliability in these systems is massive MIMO (Multiple-Input Multiple-Output). One reason for this…

Signal Processing · Electrical Eng. & Systems 2020-04-16 Sara Gunnarsson , José Flordelis , Liesbet Van der Perre , Fredrik Tufvesson

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 provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Mojtaba Soltanalian , Sina Maleki , Symeon Chatzinotas , Björn Ottersten

In this contribution, models of wireless channels are derived from the maximum entropy principle, for several cases where only limited information about the propagation environment is available. First, analytical models are derived for the…

Information Theory · Computer Science 2007-07-13 M. Guillaud , M. Debbah , A. L. Moustakas

This paper investigates the spectrum sharing between a multiple-input single-output (MISO) secure communication system and a multiple-input multiple-output (MIMO) radar system in the presence of one suspicious eavesdropper. We jointly…

Information Theory · Computer Science 2024-01-29 Peng Liu , Zesong Fei , Xinyi Wang , Zhong Zheng , Xiangnan Li , Jie Xu

We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models. We present explicit wiretap codes that can handle these models in a unified…

Information Theory · Computer Science 2022-11-03 Remi A. Chou

We study the problem of joint communication and detection of wiretapping on an optical fiber from a quantum perspective. Our system model describes a communication link that is capable of transmitting data under normal operating conditions…

Quantum Physics · Physics 2025-03-13 Pere Munar-Vallespir , Janis Nötzel , Florian Seitz

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

A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete…

Information Theory · Computer Science 2013-05-08 Somayeh Salimi , Mikael Skoglund , Mahmoud Salmasizadeh , Mohammad Reza Aref

The existing investigations on artificial noise (AN) security systems assumed that only null spaces is used to send AN signals, and all eigen-subchannels should be used to transmit messages. Our previous work proposed an AN scheme that…

Information Theory · Computer Science 2020-07-15 Yiliang Liu , Hsiao-Hwa Chen , Liangmin Wang , Weixiao Meng

We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user…

Information Theory · Computer Science 2010-03-01 Ersen Ekrem , Sennur Ulukus