English
Related papers

Related papers: Secure Capacity Region for Erasure Broadcast Chann…

200 papers

In this paper, the capacity region of the Layered Packet Erasure Broadcast Channel (LPE-BC) with Channel Output Feedback (COF) available at the transmitter is investigated. The LPE-BC is a high-SNR approximation of the fading Gaussian BC…

Information Theory · Computer Science 2019-01-08 Siyao Li , Daniela Tuninetti , Natasha Devroye

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

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

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 study capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while…

Information Theory · Computer Science 2016-11-17 Jin Xu , Yi Cao , Biao Chen

Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the…

Quantum Physics · Physics 2009-11-11 Ting Gao , Feng-Li Yan , Zhi-Xi Wang

We propose a two-way secure-communication protocol in which Alice uses an amplified spontaneous emission source while Bob employs binary phase-shift keying and an optical amplifier. Against an eavesdropper who captures all the light lost in…

Quantum Physics · Physics 2015-10-27 Quntao Zhuang , Zheshen Zhang , Justin Dove , Franco N. C. Wong , Jeffrey H. Shapiro

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

We consider a set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method…

Information Theory · Computer Science 2013-05-07 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi

This letter studies an emerging wireless communication intervention problem at the physical layer, where a legitimate spoofer aims to spoof a malicious link from Alice to Bob, by replacing Alice's transmitted source message with its target…

Information Theory · Computer Science 2016-12-28 Jie Xu , Lingjie Duan , Rui Zhang

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

In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…

Information Theory · Computer Science 2010-04-07 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…

Information Theory · Computer Science 2017-11-01 Shaofeng Zou , Yingbin Liang , Lifeng Lai , H. Vincent Poor , Shlomo Shamai

This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling…

Information Theory · Computer Science 2009-08-27 Aly El Gamal , Moustafa Youssef , Hesham El Gamal

This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ("amplify") the channel state sequence to Bob while "masking" it from Eve. The extent…

Information Theory · Computer Science 2015-10-27 O. Ozan Koyluoglu , Rajiv Soundararajan , Sriram Vishwanath

The secrecy capacity region for the K-receiver degraded broadcast channel (BC) is given for confidential messages sent to the receivers and to be kept secret from an external wiretapper. Superposition coding and Wyner's random code…

Information Theory · Computer Science 2008-12-22 Li-Chia Choo , Kai-Kit Wong

We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user…

Information Theory · Computer Science 2010-03-01 Ersen Ekrem , Sennur Ulukus

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…

Information Theory · Computer Science 2015-03-20 Fan Cheng , Raymond W. Yeung , Kenneth W. Shum

Hiding the wireless communication by transmitter Alice to intended receiver Bob from a capable and attentive adversary Willie has been widely studied under the moniker "covert communications". However, when such covert communication is done…

Cryptography and Security · Computer Science 2023-07-18 Ali Mohammadi Teshnizi , Majid Ghaderi , Dennis Goeckel

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship