English
Related papers

Related papers: Plausible Deniability over Broadcast Channels

200 papers

To improve national security, government agencies have long been committed to enforcing powerful surveillance measures on suspicious individuals or communications. In this paper, we consider a wireless legitimate surveillance system, where…

Information Theory · Computer Science 2017-05-01 Caijun Zhong , Xin Jiang , Fengzhong Qu , Zhaoyang Zhang

Outer bounds on the admissible source region for broadcast channels with dependent sources are developed and used to prove capacity results for several classes of sources and channels.

Information Theory · Computer Science 2009-02-16 Gerhard Kramer , Yingbin Liang , Shlomo Shamai

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore

This letter studies information-theoretic security without knowing the eavesdropper's channel fading state. We present an alternative secrecy outage formulation to measure the probability that message transmissions fail to achieve perfect…

Information Theory · Computer Science 2016-11-17 Xiangyun Zhou , Matthew R. McKay , Behrouz Maham , Are Hjorungnes

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

In this paper we investigate the potential for persuasion arising from the quantum indeterminacy of a decision-maker's beliefs, a feature that has been proposed as a formal expression of well-known cognitive limitations. We focus on a…

Physics and Society · Physics 2018-05-25 Vladimir I. Danilov , Ariane Lambert-Mogiliansky

We consider the parameterized verification of arbitrarily large networks of agents which communicate by broadcasting and receiving messages. In our model, the broadcast topology is reconfigurable so that a sent message can be received by…

Logic in Computer Science · Computer Science 2024-03-05 Lucie Guillou , Corto Mascle , Nicolas Waldburger

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

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

Given a communication system using quantum key distribution, the receiver can be seen as one who tries to guess the sender's information just as potential eavesdroppers do. The receiver-eavesdropper similarity thus implies a simple relation…

Quantum Physics · Physics 2022-09-28 Hong-Yi Su

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders…

Information Theory · Computer Science 2014-06-05 Moritz Wiese , Holger Boche

The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has…

Information Theory · Computer Science 2007-07-13 Jinhua Jiang , Xin Yan

Different polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding and/or layered secrecy. In this setting, the transmitter wishes to send…

Information Theory · Computer Science 2018-06-19 Jaume del Olmo , Javier R. Fonollosa

In this work, we study the arbitrarily varying broadcast channel (AVBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the…

Information Theory · Computer Science 2017-09-19 Uzi Pereg , Yossef Steinberg

We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent…

Information Theory · Computer Science 2020-08-11 Yasutada Oohama

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

We investigate the maximum rates for transmitting quantum information, distilling entanglement, and distributing secret keys between a sender and a receiver in a multipoint communication scenario, with the assistance of unlimited two-way…

Quantum Physics · Physics 2017-11-30 Riccardo Laurenza , Stefano Pirandola

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

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2023-03-22 Onur Günlü , Matthieu R. Bloch , Rafael F. Schaefer , Aylin Yener

We address the problem of bounding below the probability of error under maximum likelihood decoding of a binary code with a known distance distribution used on a binary symmetric channel. An improved upper bound is given for the maximum…

Information Theory · Computer Science 2007-07-16 Alexander Barg , Andrew McGregor