English
Related papers

Related papers: Opportunistic Secrecy with a Strict Delay Constrai…

200 papers

While the impact of finite-rate feedback on the capacity of fading channels has been extensively studied in the literature, not much attention has been paid to this problem under secrecy constraint. In this work, we study the ergodic secret…

Information Theory · Computer Science 2014-11-07 Shuiyin Liu , Yi Hong , Emanuele Viterbo

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings

This paper studies the physical layer security of a vehicular communication network in the presence of interference constraints by analysing its secrecy capacity. The system considers a legitimate receiver node and an eavesdropper node,…

Signal Processing · Electrical Eng. & Systems 2019-11-20 Abubakar U. Makarfi , Rupak Kharel , Khaled M. Rabie , Omprakash Kaiwartya , Galymzhan Nauryzbayev

This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…

Information Theory · Computer Science 2018-10-16 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

This paper explores a new secure wireless communication paradigm where the physical layer security technology is applied to counteract both the detection and eavesdropping attacks, such that the critical covertness and secrecy properties of…

Information Theory · Computer Science 2021-03-11 Huihui Wu , Yuanyu Zhang , Yulong Shen , Xiaohong Jiang

In this paper, we consider a multiple-input multiple-output (MIMO) system consisting of one source, one destination and one eavesdropper, where each node is equipped with an arbitrary number of antennas. To improve the security of…

Information Theory · Computer Science 2016-11-15 Jia Zhu , Yulong Zou , Gongpu Wang , Yu-Dong Yao , George K. Karagiannidis

Secrecy transmission is investigated for a cooperative jamming scheme, where a multi-antenna jam-mer generates artificial noise (AN) to confuse eavesdroppers. Two kinds of eavesdroppers are considered: passive eavesdroppers who only…

Signal Processing · Electrical Eng. & Systems 2020-02-19 Jiangbo Si , Zihao Cheng , Zan Li , Julian Cheng , Hui-Ming Wang , Naofal Al-Dhahir

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

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

We study the outage probability of opportunistic relay selection in decode-and-forward relaying with secrecy constraints. We derive the closed-form expression for the outage probability. Based on the analytical result, the asymptotic…

Information Theory · Computer Science 2011-11-16 Xiaojun Sun , Chunming Zhao

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

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche

A simple approximation for the secrecy outage probability (SOP) over generalized-K fading channels is developed. This approximation becomes tighter as the average signal-to-noise ratio (SNR) of the wiretap channel decreases. Based on this…

Information Theory · Computer Science 2019-07-04 Hui Zhao , Yuanwei Liu , Ahemd Sultan-Salem , Mohamed-Slim Alouini

The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple…

Information Theory · Computer Science 2007-08-31 Ashish Khisti , Gregory Wornell

The effect of Rician-ness on the capacity of multiple antenna systems is investigated under the assumption that channel state information (CSI) is available only at the receiver. The average-power-constrained capacity of such systems is…

Information Theory · Computer Science 2007-07-13 Sudharman K. Jayaweera , H. Vincent Poor

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

Information Theory · Computer Science 2017-06-14 Wei Yang , Rafael F. Schaefer , H. Vincent Poor

In this paper the fading multiple antenna (MIMO) wire-tap channel is investigated under short term power constraints. The secret diversity gain and the secret multiplexing gain are defined. Using these definitions, the secret…

Information Theory · Computer Science 2015-03-13 Melda Yuksel , Elza Erkip

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of the capacity-achieving input signals is…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

The existing research on physical layer security commonly assumes the number of eavesdropper antennas to be known. Although this assumption allows one to easily compute the achievable secrecy rate, it can hardly be realized in practice. In…

Information Theory · Computer Science 2016-11-17 Biao He , Xiangyun Zhou , Thushara D. Abhayapala
‹ Prev 1 8 9 10 Next ›