English
Related papers

Related papers: Constrained Colluding Eavesdroppers: An Informatio…

200 papers

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a…

Information Theory · Computer Science 2016-11-17 Alessandro Biason , Nicola Laurenti , Michele Zorzi

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

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

We present information-theoretic definitions and results for analyzing symmetric-key encryption schemes beyond the perfect secrecy regime, i.e. when perfect secrecy is not attained. We adopt two lines of analysis, one based on lossless…

Information Theory · Computer Science 2015-03-31 Flavio du Pin Calmon , Muriel Médard , Mayank Varia , Ken R. Duffy , Mark M. Christiansen , Linda M. Zeger

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the…

Information Theory · Computer Science 2008-05-02 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

This paper introduces a methodology based on Euclidean information theory to investigate local properties of secure communication over discrete memoryless wiretap channels. We formulate a constrained optimization problem that maximizes a…

Information Theory · Computer Science 2026-05-14 Emmanouil M. Athanasakos , Nicholas Kalouptsidis , Hariprasad Manjunath

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using…

Information Theory · Computer Science 2016-11-15 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

Theoretical studies on physical layer security often adopt the secrecy outage probability as the performance metric for wireless communications over quasi-static fading channels. The secrecy outage probability has two limitations from a…

Information Theory · Computer Science 2016-11-15 Biao He , Xiangyun Zhou , A. Lee Swindlehurst

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

We consider the secure transmission in ergodic fast-Rayleigh fading multiple-input single-output single-antennaeavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels is the…

Information Theory · Computer Science 2015-03-20 Shih-Chun Lin , Pin-Hsun Lin

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…

Information Theory · Computer Science 2025-10-30 Hadi Aghaee , Christian Deppe , Holger Boche

Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , H. Vincent Poor

We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another…

Information Theory · Computer Science 2017-10-04 Inaki Estella Aguerri , Abdellatif Zaidi

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

This paper considers a distributionally robust chance constraint model with a general ambiguity set. We show that a sample based approximation of this model converges under suitable sufficient conditions. We also show that upper and lower…

Optimization and Control · Mathematics 2025-01-17 Jiaqi Lei , Sanjay Mehrotra

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

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

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$…

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
‹ Prev 1 4 5 6 7 8 10 Next ›