English
Related papers

Related papers: Secrecy Through Synchronization Errors

200 papers

This paper studies the problem of remote state estimation in the presence of a passive eavesdropper. A sensor measures a linear plant's state and transmits it to an authorized user over a packet-dropping channel, which is susceptible to…

Systems and Control · Computer Science 2018-09-21 Anastasios Tsiamis , Konstantinos Gatsis , George Pappas

We study a four terminal parallel relay-eavesdropper channel which consists of multiple independent relay-eavesdropper channels as subchannels. For the discrete memoryless case, we establish inner and outer bounds on the rate-equivocation…

Information Theory · Computer Science 2010-11-10 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

We propose a simple yet efficient scheme for a set of energy-harvesting sensors to establish secure communication with a common destination (a master node). An eavesdropper attempts to decode the data sent from the sensors to their common…

Networking and Internet Architecture · Computer Science 2016-12-26 Ahmed El Shafie , Naofal Al-Dhahir

This work addresses private communication with distributed systems in mind. We consider how to best use secret key resources and communication to transmit signals across a system so that an eavesdropper is least capable to act on the…

Cryptography and Security · Computer Science 2015-03-19 Paul Cuff

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , 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

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

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

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

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…

Information Theory · Computer Science 2016-11-15 Ashish Khisti , 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

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of…

Information Theory · Computer Science 2018-02-20 Rafael F. Schaefer , Ashish Khisti , H. Vincent Poor

In this paper, we consider the problem of joint transmit precoding (TPC) matrix and receive filter matrix design subject to both secrecy and per-transmitter power constraints in the MIMO interference channel, where $K$ legitimate…

Information Theory · Computer Science 2016-01-20 Zhengmin Kong , Shaoshi Yang , Feilong Wu , Shixin Peng , Liang Zhong , Lajos Hanzo

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

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

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

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

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic…

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama