English
Related papers

Related papers: On Secure Network Coding with Nonuniform or Restri…

200 papers

The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is "noisier" than the channel from sender to receiver. It…

Information Theory · Computer Science 2015-03-20 Mihir Bellare , Stefano Tessaro , Alexander Vardy

This paper proposes a generic approach for providing enhanced security to communication systems which encode their data for reliability before encrypting it through a stream cipher for security. We call this counter-intuitive technique the…

Cryptography and Security · Computer Science 2010-08-06 Frederique Oggier , Miodrag J. Mihaljevic

In this paper, we explore the connection between secret key agreement and secure omniscience within the setting of the multiterminal source model with a wiretapper who has side information. While the secret key agreement problem considers…

Information Theory · Computer Science 2023-07-28 Praneeth Kumar Vippathalla , Chung Chan , Navin Kashyap , Qiaoqiao Zhou

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…

Information Theory · Computer Science 2020-03-10 Manos Athanasakos , Nicholas Kalouptsidis

The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with non-degraded general wiretap channels by Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost constraint, we…

Information Theory · Computer Science 2014-08-20 Te Sun Han , Hiroyuki Endo , Masahide Sasaki

It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to $z$ network links, to assume that the source node is the only node that generates random keys. In this setting, the secure…

Information Theory · Computer Science 2019-07-09 Debaditya Chaudhuri , Michael Langberg , Michelle Effros

We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should…

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

This paper investigates a joint source-channel secrecy problem for the Shannon cipher broadcast system. We suppose list secrecy is applied, i.e., a wiretapper is allowed to produce a list of reconstruction sequences and the secrecy is…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than…

Information Theory · Computer Science 2009-05-14 Shweta Agrawal , Sriram Vishwanath

Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the…

Information Theory · Computer Science 2017-07-25 Lei Yu , Houqiang Li , Weiping Li

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 the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver.…

Information Theory · Computer Science 2018-05-08 Yanru Tang , Faeze Heydaryan , Jie Luo

The fundamental limit of Semantic Communications (joint source-channel coding) is established when the transmission needs to be kept covert from an external warden. We derive information-theoretic achievability and matching converse results…

Information Theory · Computer Science 2024-06-21 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the…

Information Theory · Computer Science 2013-01-10 Meysam Mirzaee , Soroush Akhlaghi

We analyze the exact exponential decay rate of the expected amount of information leaked to the wiretapper in Wyner's wiretap channel setting using wiretap channel codes constructed from both i.i.d. and constant-composition random codes.…

Information Theory · Computer Science 2016-11-30 Mani Bastani Parizi , Emre Telatar , Neri Merhav

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, we consider achievable secrecy rates for symmetric $K$-user ($K \ge 3$) interference channels with confidential messages. We find that nested lattice codes and layered coding are useful in providing secrecy for these channels.…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

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…