English
Related papers

Related papers: On the Capacity Region for Secure Index Coding

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-10-19 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

A code equivalence between index coding and network coding was established, which shows that any index-coding instance can be mapped to a network-coding instance, for which any index code can be translated to a network code with the same…

Information Theory · Computer Science 2018-04-27 Lawrence Ong , Jörg Kliewer , Badri N. Vellambi , Phee Lep Yeoh

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably…

Information Theory · Computer Science 2019-02-19 Jaume del Olmo Alos , Javier R. Fonollosa

Using a broadcast channel to transmit clients' data requests may impose privacy risks. In this paper, we address such privacy concerns in the index coding framework. We show how a malicious client can infer some information about the…

Information Theory · Computer Science 2018-10-16 Mohammed Karmoose , Linqi Song , Martina Cardone , Christina Fragouli

We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In particular, here we consider a generalized setting where…

Information Theory · Computer Science 2014-03-13 Lawrence Ong , Fabian Lim , Chin Keong Ho

This paper investigates the problem of secure communication in a wireline noiseless scenario where a source wishes to communicate to a number of destinations in the presence of a passive external adversary. Different from the multicast…

Information Theory · Computer Science 2019-01-10 Gaurav Kumar Agarwal , Martina Cardone , Christina Fragouli

A private compression design problem is studied, where an encoder observes useful data $Y$, wishes to compress it using variable length code and communicates it through an unsecured channel. Since $Y$ is correlated with private data $X$,…

Information Theory · Computer Science 2023-11-21 Amirreza Zamani , Tobias J. Oechtering , Mikael Skoglund

Consider the Gaussian wiretap channel, where a transmitter wishes to send a confidential message to a legitimate receiver in the presence of an eavesdropper. It is well known that if the eavesdropper experiences less channel noise than the…

Information Theory · Computer Science 2026-01-29 Vidhi Rana , Remi A. Chou , Taejoon Kim

An index code for a broadcast channel with receiver side information is 'locally decodable' if every receiver can decode its demand using only a subset of the codeword symbols transmitted by the sender instead of observing the entire…

Information Theory · Computer Science 2019-04-10 Smiju Kodamthuruthil Joy , Lakshmi Natarajan

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

This paper studies the problem of remote state estimation in the presence of a passive eavesdropper. A sensor measures a linear plant's state and transmits it to an authorized user over a packet-dropping channel, which is susceptible to…

Systems and Control · Computer Science 2018-09-21 Anastasios Tsiamis , Konstantinos Gatsis , George Pappas

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

The index coding problem is a problem of efficient broadcasting with side-information. We look at the uniprior index coding problem, in which the receivers have disjoint side-information symbols and arbitrary demand sets. Previous work has…

Information Theory · Computer Science 2017-01-24 Vijaya Kumar Mareedu , Prasad Krishnan

It has been found that the signal can be encoded in the choice of the measurement basis of one of the communicating parties, while the outcomes of the measurement are irrelevant for the communication and therefore may be discarded. The…

Quantum Physics · Physics 2015-06-17 Dong Xie , An Min Wang

We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure…

Information Theory · Computer Science 2016-11-29 Xuan Guang , Raymond W. Yeung

An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…

Information Theory · Computer Science 2019-01-18 Lakshmi Natarajan , Hoang Dau , Prasad Krishnan , V. Lalitha

We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certain packets. This presents a problem of broadcasting in the presence of…

Information Theory · Computer Science 2011-08-10 Michael J. Neely , Arash Saber Tehrani , Zhen Zhang

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 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

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…

‹ Prev 1 3 4 5 6 7 10 Next ›