English
Related papers

Related papers: Shannon's secrecy system with informed receivers a…

200 papers

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-05-01 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are…

Information Theory · Computer Science 2009-09-12 Tan F. Wong , Matthieu Bloch , John M. Shea

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

One of the key aspects of Shannon's theory is that it provides guidance for designing the most efficient systems, such as minimizing errors and clarifying the limits of coding. Such theories have made great developments in the 50 years…

Quantum Physics · Physics 2025-10-10 Osamu Hirota

We consider a basic communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends an encoded sequence to the receiver through a discrete memoryless channel, and the receiver is interested in…

Information Theory · Computer Science 2022-05-11 Han Wu , Hamdi Joudeh

This research note suggests a new way to realize a high speed direct encryption based on quantum detection theory. The conventional cipher is designed by a mathematical algorithm and its security is evaluated by the complexity of the…

Quantum Physics · Physics 2015-11-03 Osamu Hirota

In wiretap model of secure communication the goal is to provide (asymptotic) perfect secrecy and reliable communication over a noisy channel that is eavesdropped by an adversary with unlimited computational power. This goal is achieved by…

Cryptography and Security · Computer Science 2014-09-05 Pengwei Wang , Reihaneh Safavi-Naini

This paper introduces the notion of cache-tapping into the information theoretic models of coded caching. The wiretap channel II in the presence of multiple receivers equipped with fixed-size cache memories, and an adversary which selects…

Information Theory · Computer Science 2021-02-16 Mohamed Nafea , Aylin Yener

This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel…

Information Theory · Computer Science 2009-09-30 Arunkumar Subramanian , Steven W. McLaughlin

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional…

Information Theory · Computer Science 2016-01-27 Ahmed S. Mansour , Rafael F. Schaefer , Holger Boche

We consider a network of two nodes separated by a noisy channel, in which the source and its reconstruction have to be strongly coordinated, while simultaneously satisfying the strong secrecy condition with respect to an outside observer of…

Information Theory · Computer Science 2020-09-04 Giulia Cervia , German Bassi , Mikael Skoglund

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

In this work, we investigate two source coding models, a \emph{Helper} problem and a \emph{Gray-Wyner} problem, under equivocation constraints. Specifically, in the Helper problem, an encoder communicates with a legitimate receiver through…

Information Theory · Computer Science 2017-01-16 Meryem Benammar , Abdellatif Zaidi

Wyner's wiretap channel is extended to parallel broadcast channels and fading channels with multiple receivers. In the first part of the paper, we consider the setup of parallel broadcast channels with one sender, multiple intended…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Aslan Tchamkerten , Gregory Wornell

Wyner's elegant model of wiretap channel exploits noise in the communication channel to provide perfect secrecy against a computationally unlimited eavesdropper without requiring a shared key. We consider an adversarial model of wiretap…

Cryptography and Security · Computer Science 2015-04-22 Pengwei Wang , Reihaneh Safavi-Naini

We consider the Shannon cipher system in the framework of individual sequences and finite-state encrypters under the metric of maximal leakage of information. A lower bound and an asymptotically matching upper bound on the leakage are…

Information Theory · Computer Science 2025-05-01 Neri Merhav

We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for…

Information Theory · Computer Science 2007-09-20 Brooke Shrader , Anthony Ephremides

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

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this Letter we relax the assumption…

Quantum Physics · Physics 2018-03-28 Daniel Ebler , Sina Salek , Giulio Chiribella

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the…

Information Theory · Computer Science 2016-11-15 Tzu-Han Chou , Vincent Y. F. Tan , Stark C. Draper