English
Related papers

Related papers: Secure Lossy Source Coding for Some Classes of Hel…

200 papers

This work studies near-field secure communications through transmit beamfocusing. We examine the benefit of having a protected eavesdropper-free zone around the legitimate receiver, and we determine the worst-case secrecy performance…

Signal Processing · Electrical Eng. & Systems 2025-11-18 Cen Liu , Xiangyun Zhou , Nan Yang , Salman Durrani , A. Lee Swindlehurst

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

We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a…

Information Theory · Computer Science 2015-03-03 Mahtab Mirmohseni , Panagiotis Papadimitratos

We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our problem can be categorized under the source models of information…

Information Theory · Computer Science 2015-03-19 Onur Gungor , Fangzhou Chen , C. Emre Koksal

We study the problem of remote state estimation in the presence of a passive eavesdropper, under the challenging network environment of no packet receipt acknowledgments. A remote legitimate user estimates the state of a linear plant from…

Systems and Control · Electrical Eng. & Systems 2023-04-06 Matthew Crimson , Justin M. Kennedy , Daniel E. Quevedo

We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As…

Information Theory · Computer Science 2016-11-15 Xiang He , Ashish Khisti , Aylin Yener

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers…

Information Theory · Computer Science 2020-04-16 Yucheng Liu , Parastoo Sadeghi , Neda Aboutorab , Arman Sharififar

We consider lossy compression of an information source when the decoder has lossless access to a correlated one. This setup, also known as the Wyner-Ziv problem, is a special case of distributed source coding. To this day, practical…

Information Theory · Computer Science 2024-05-22 Ezgi Ozyilkan , Johannes Ballé , Elza Erkip

This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate…

Information Theory · Computer Science 2021-07-30 Hao Xu , Tianyu Yang , Kai-Kit Wong , Giuseppe Caire

In this work, the problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the…

Information Theory · Computer Science 2010-08-03 Ghadamali Bagherikaram , Konstantinos N. Plataniotis

Consider the problem where a statistician in a two-node system receives rate-limited information from a transmitter about marginal observations of a memoryless process generated from two possible distributions. Using its own observations,…

Information Theory · Computer Science 2017-03-02 Gil Katz , Pablo Piantanida , Mérouane Debbah

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

We consider in this paper the problem of information reconciliation in the context of secret key agreement between two legitimate parties, Alice and Bob. Beginning the discussion with the secret key agreement model introduced by Ahlswede…

Information Theory · Computer Science 2011-06-07 David Elkouss , Jesus Martinez-Mateo , Vicente Martin

In this paper, we consider multiple cache-enabled end-users connected to multiple transmitters through a linear network. We also prevent a totally passive eavesdropper, who sniffs the packets in the delivery phase, from obtaining any…

Information Theory · Computer Science 2022-11-29 Mohammad Javad Sojdeh , Mehdi Letafati , Seyed Pooya Shariatpanahi , Babak Hossein Khalaj

Wireless communication is susceptible to adversarial eavesdropping due to the broadcast nature of the wireless medium. In this paper it is shown how eavesdropping can be alleviated by exploiting the superposition property of the wireless…

Information Theory · Computer Science 2016-11-17 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

We consider theoretical limits of partial secrecy in a setting where an eavesdropper attempts to causally reconstruct an information sequence with low distortion based on an intercepted transmission and the past of the sequence. The…

Information Theory · Computer Science 2010-08-05 Paul Cuff

We assume that a buffer-aided transmitter communicates with a receiving node in the presence of an attacker. We investigate the impact of a radio-frequency energy-harvesting attacker that probabilistically operates as a jammer or an…

Information Theory · Computer Science 2017-06-20 Ahmed El Shafie , Kamel Tourki , Zhiguo Ding , Naofal Al-Dhahir

In this paper, we study beamforming in decode-and-forward (DF) relaying using multiple relays, where the source node sends a secret message as well as a non-secret message to the destination node in the presence of multiple non-colluding…

Information Theory · Computer Science 2014-02-03 Sanjay Vishwakarma , A. Chockalingam

Wyner's common information was originally defined for a pair of dependent discrete random variables. Its significance is largely reflected in, hence also confined to, several existing interpretations in various source coding problems. This…

Information Theory · Computer Science 2013-01-11 Ge Xu , Wei Liu , Biao Chen

This article introduces a novel lightweight framework using ambient backscattering communications to counter eavesdroppers. In particular, our framework divides an original message into two parts: (i) the active-transmit message transmitted…

Networking and Internet Architecture · Computer Science 2023-08-07 Nam H. Chu , Nguyen Van Huynh , Diep N. Nguyen , Dinh Thai Hoang , Shimin Gong , Tao Shu , Eryk Dutkiewicz , Khoa T. Phan
‹ Prev 1 8 9 10 Next ›