English
Related papers

Related papers: Secrecy Capacity over Correlated Ergodic Fading Ch…

200 papers

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

We consider a secure integrated sensing and communication (ISAC) scenario, in which a signal is transmitted through a state-dependent wiretap channel with one legitimate receiver with which the transmitter communicates and one…

Information Theory · Computer Science 2024-09-02 Martin Mittelbach , Rafael F. Schaefer , Matthieu Bloch , Aylin Yener , Onur Günlü

A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…

Information Theory · Computer Science 2015-03-20 Zouheir Rezk , Mohamed-Slim Alouini

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential…

Information Theory · Computer Science 2016-11-17 Yingbin Liang , H. Vincent Poor , Shlomo Shamai

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

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 covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

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

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

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

Information Theory · Computer Science 2013-02-25 Reza K. Farsani

In physical-layer security, one of the most fundamental issues is the secrecy capacity. The objective of this paper is to determine the secrecy capacity for an indoor visible light communication system consisting of a transmitter, a…

Information Theory · Computer Science 2021-09-24 Jin-Yuan Wang , Xian-Tao Fu , Jun-Bo Wang , Min Lin , Julian Cheng , Mohamed-Slim Alouini

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

Information Theory · Computer Science 2009-10-20 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of…

Information Theory · Computer Science 2012-11-20 Theodoros K. Dikaliotis , Hongyi Yao , Tracey Ho , Michelle Effros , Joerg Kliewer

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

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

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each…

Information Theory · Computer Science 2013-09-09 Matthieu R. Bloch , J. Nicholas Laneman

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This paper presents a detailed secrecy outage performance analysis of correlated multi-antenna wiretap channels with three popular diversity combining schemes, namely maximal ratio combining, selection combining, and equal gain combining at…

Information Theory · Computer Science 2018-08-10 Jiangbo Si , Zan Li , Julian Cheng , Caijun Zhong

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

Information Theory · Computer Science 2010-10-07 G. D. Raghava , B. Sundar Rajan