English
Related papers

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

200 papers

Considering a multiple-user multiple-input multiple-output (MIMO) channel with an eavesdropper, this letter develops a beamformer design to optimize the energy efficiency in terms of secrecy bits per Joule under secrecy quality-of-service…

Information Theory · Computer Science 2017-01-19 Nguyen T. Nghia , Hoang D. Tuan , Trung Q. Duong , H. Vincent Poor

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

Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to sense and learn the adversary's actions. The adversary has the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Matthieu R. Bloch , Aylin Yener

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

In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function…

Information Theory · Computer Science 2016-11-15 Mario Goldenbaum , Holger Boche , H. Vincent Poor

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

The growth of interest in massive MIMO systems is accompanied with hardware cost and computational complexity. Antenna selection is an efficient approach to overcome this cost-plus-complexity issue which also enhances the secrecy…

Information Theory · Computer Science 2018-05-31 Ali Bereyhi , Saba Asaad , Rafael F. Schaefer , Ralf R. Müller

In this paper, we study the impacts of transmit antenna selection on the secrecy performance of massive MIMO systems. We consider a wiretap setting in which a fixed number of transmit antennas are selected and then confidential messages are…

Information Theory · Computer Science 2018-03-06 Saba Asaad , Ali Bereyhi , Amir M. Rabiei , Ralf R. Müller , Rafael F. Schaefer

The problem of resource allocation in multiple-antenna wiretap channels is investigated, wherein a malicious user tries to eavesdrop the communication between two legitimate users. Both multiple input single output single-antenna…

Information Theory · Computer Science 2015-05-12 Alessio Zappone , Pin-Hsun Lin , Eduard A. Jorswieck

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

Information Theory · Computer Science 2023-06-27 Johannes Rosenberger , Abdalla Ibrahim , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

A scenario in which a single source communicates with a single destination via a distributed MIMO transceiver is considered. The source operates each of the transmit antennas via finite-capacity links, and likewise the destination is…

Information Theory · Computer Science 2016-11-17 Osvaldo Simeone , Oren Somekh , H. Vincent Poor , Shlomo Shamai

In this paper, we investigate the design of artificial-noise-aided secure multi-antenna transmission in slow fading channels. The primary design concerns include the transmit power allocation and the rate parameters of the wiretap code. We…

Information Theory · Computer Science 2016-11-17 Xi Zhang , Xiangyun Zhou , Matthew R. McKay

A Gaussian multiple-input multiple-output (MIMO) wiretap channel model is considered. The input is a two-antenna transmitter, while the outputs are the legitimate receiver and an eavesdropper, both equipped with multiple antennas. All…

Information Theory · Computer Science 2011-07-28 Jiangyuan Li , Athina Petropulu

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

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

Information Theory · Computer Science 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

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

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

Information Theory · Computer Science 2008-12-02 Ersen Ekrem , Sennur Ulukus

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

In this paper, we investigate secure communication over sparse millimeter-wave (mm-Wave) massive multiple-input multiple-output (MIMO) channels by exploiting the spatial sparsity of legitimate user's channel. We propose a secure…

Information Theory · Computer Science 2019-11-19 Jindan Xu , Wei Xu , Derrick Wing Kwan Ng , A. Lee Swindlehurst