English
Related papers

Related papers: Wireless Information-Theoretic Security - Part I: …

200 papers

A novel information theoretic approach is proposed to solve the secret sharing problem, in which a dealer distributes one or multiple secrets among a set of participants that for each secret only qualified sets of users can recover it by…

Information Theory · Computer Science 2014-04-28 Shaofeng Zou , Yingbin Liang , Lifeng Lai , Shlomo Shamai

In this paper, we consider the transmission of confidential messages over slow fading wireless channels in the presence of an eavesdropper. We propose a transmission scheme that employs a single reconfigurable antenna at each of the…

Information Theory · Computer Science 2014-02-06 Ahmed M. Alaa

We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable…

Information Theory · Computer Science 2013-12-12 Mahtab Mirmohseni , Panagiotis Papadimitratos

This paper investigates the impact of realistic propagation conditions on the achievable secrecy performance of multiple-input multiple-output systems in the presence of an eavesdropper. Specifically, we concentrate on the $\kappa$-$\mu$…

Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channels to strengthen the security of communications systems.…

Networking and Internet Architecture · Computer Science 2016-11-18 Pedro C. Pinto , Joao Barros , Moe Z. Win

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…

Information Theory · Computer Science 2016-11-17 Karim Khalil , O. Ozan Koyluoglu , Hesham El Gamal , Moustafa Youssef

Imperfect secrecy in communication systems is investigated. Instead of using equivocation as a measure of secrecy, the distortion that an eavesdropper incurs in producing an estimate of the source sequence is examined. The communication…

Information Theory · Computer Science 2012-10-09 Curt Schieler , Eva C. Song , Paul Cuff , H. Vincent Poor

We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability no larger than $\varepsilon$ but the leakage to the eavesdropper vanishes. For discrete…

Information Theory · Computer Science 2014-09-29 Vincent Y. F. Tan , Matthieu R. Bloch

This letter studies the problem of maintaining information freshness under passive eavesdropping attacks. The classical three-node wiretap channel model is considered, in which a source aims to send its latest status wirelessly to its…

Cryptography and Security · Computer Science 2020-02-19 He Chen , Qian Wang , Parthajit Mohapatra , Nikolaos Pappas

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

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

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 2007-07-13 Yingbin Liang , H. Vincent Poor , Shlomo Shamai

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Networking and Internet Architecture · Computer Science 2012-12-03 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers.…

Information Theory · Computer Science 2010-07-01 Xiangyun Zhou , Matthew R. McKay

We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is…

Information Theory · Computer Science 2016-11-17 Chenxi Liu , Nan Yang , Jinhong Yuan , Robert Malaney

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user…

Information Theory · Computer Science 2013-01-01 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

Covert communications enable a transmitter to send information reliably in the presence of an adversary, who looks to detect whether the transmission took place or not. We consider covert communications over quasi-static block fading…

Information Theory · Computer Science 2020-09-29 Khurram Shahzad , Xiangyun Zhou

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the…

Information Theory · Computer Science 2016-08-18 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…

Information Theory · Computer Science 2010-12-02 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar