English
Related papers

Related papers: Secure Capacity Region for Erasure Broadcast Chann…

200 papers

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

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

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

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of…

Information Theory · Computer Science 2016-11-18 Manoj Mishra , Tanmay Sharma , Bikash K. Dey , Vinod M. Prabhakaran

Achievable data rates in wireless systems rely heavily on the available channel state information (CSI) throughout the network. However, feedback links, which provide this information, are scarce, unreliable, and subject to security…

Information Theory · Computer Science 2021-02-08 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

In this paper, we derive information-theoretic performance limits for secure and reliable communications over the general two-user discrete memoryless broadcast channel with side-information at the transmitter. The sender wishes to…

Information Theory · Computer Science 2011-09-27 K. G. Nagananda , Chandra R Murthy , Shalinee Kishore

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and…

Information Theory · Computer Science 2011-10-04 Aly El Gamal , O. Ozan Koyluoglu , Moustafa Youssef , Hesham El Gamal

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. Two scenarios are considered: (i) when the transmitter has causal…

Information Theory · Computer Science 2018-02-21 Michael Heindlmaier , Shirin Saeedi Bidokhti

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages to two receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless communications, where…

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

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two…

Information Theory · Computer Science 2016-11-15 Vinod M. Prabhakaran , Krishnan Eswaran , Kannan Ramchandran

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity…

Information Theory · Computer Science 2020-05-19 Alireza Vahid , Shih-Chun Lin , I-Hsiang Wang

Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , H. Vincent Poor

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Gerhard Kramer , Haim H. Permuter , Paul Cuff

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2007-10-01 Ruoheng Liu , H. Vincent Poor
‹ Prev 1 2 3 10 Next ›