Private Broadcasting: An index coding approach

Karmoose, Mohammed; Song, Linqi; Cardone, Martina; Fragouli, Christina

doi:10.1109/isit.2017.8006988

Cited by 18 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, we note that the rate constraint (4) and polymatroidal constraints (5)-(8) appeared in [11] to form an outer bound on the non-secure index coding capacity region 1 , which is known to be tight for all index coding problems with n ≤ 5 messages. Constraint (9) captures additional decoding conditions for each legitimate receiver i ∈ [n], since…”

Section: Polymatroidal Outer Boundmentioning

confidence: 99%

“…The private index coding problem with linear codes was studied in [8] where the aim is to allow legitimate receivers to only learn about messages they want, but nothing of other unknown messages. Finally, [9], [10] considered the case in which the identity of the demanded message and the side information of each receiver should be kept private from other receivers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Capacity Region for Secure Index Coding

Liu

Vellambi

Kim

et al. 2018

2018 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

We study the index coding problem in the presence of an eavesdropper, where the aim is to communicate without allowing the eavesdropper to learn any single message aside from the messages it may already know as side information. We establish an outer bound on the underlying secure capacity region of the index coding problem, which includes polymatroidal and security constraints, as well as the set of additional decoding constraints for legitimate receivers. We then propose a secure variant of the composite coding scheme, which yields an inner bound on the secure capacity region of the index coding problem. For the achievability of secure composite coding, a secret key with vanishingly small rate may be needed to ensure that each legitimate receiver who wants the same message as the eavesdropper, knows at least two more messages than the eavesdropper. For all securely feasible index coding problems with four or fewer messages, our numerical results establish the secure index coding capacity region.

show abstract

Section: Polymatroidal Outer Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On the Capacity Region for Secure Index Coding

Liu

Vellambi

Kim

et al. 2018

2018 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

show abstract

“…This problem differs from secure index coding [9]: our goal is to protect the clients from an eavesdropper who wishes to learn the identities, rather than the contents, of the requested messages. Our initial work in [3] addressed the possibility of designing coding matrices that provide privacy guarantees for clients. The solutions based on k-limited-access schemes proposed in [1] can be interpreted as finding overcomplete bases that allow sparse representation of vectors, which is closely related to dictionary learning [10].…”

Section: Related Workmentioning

confidence: 99%

Privacy in Index Coding: Improved Bounds and Coding Schemes

Karmoose

Song

Cardone

et al. 2018

2018 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

It was recently observed in [1], that in index coding, learning the coding matrix used by the server can pose privacy concerns: curious clients can extract information about the requests and side information of other clients. One approach to mitigate such concerns is the use of k-limited-access schemes [1], that restrict each client to learn only part of the index coding matrix, and in particular, at most k rows. These schemes transform a linear index coding matrix of rank T to an alternate one, such that each client needs to learn at most k of the coding matrix rows to decode its requested message. This paper analyzes k-limited-access schemes. First, a worst-case scenario, where the total number of clients n is 2 T − 1 is studied. For this case, a novel construction of the coding matrix is provided and shown to be order-optimal in the number of transmissions. Then, the case of a general n is considered and two different schemes are designed and analytically and numerically assessed in their performance. It is shown that these schemes perform better than the one designed for the case n = 2 T − 1.

show abstract

“…In [3], the Authors proposed an IC model where an eavesdropper has a limited access to the side information sets and to the transmitted codeword; the goal here is to prevent the eavesdropper from obtaining any new information. In [5], the Authors considered an IC model where the sender must design a code that allows each user to decode its desired message, but at the same time prevent him from obtaining any information about the side information or the desired messages of the other users. This latter model has the flavor of the private information retrieval problem [11], where a user wants to hide its desired message and/or side information from the other users and the server.…”

Section: Introductionmentioning

confidence: 99%

Private Pliable Index Coding

Tuninetti

2019

2019 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

The Pliable Index CODing (PICOD) problem is a variant of the Index Coding (IC) problem, where the desired messages by the users, who are equipped with message side information, is part of the optimization. This paper studies the PICOD problem where users are subject to a privacy constraint. In particular, the following spacial class of private PICODs is investigated: 1) the side information structure is circular, and 2) each user can decode one and only one message. The first condition is a special case of the "circular-arc network topology hypergraph" class of PICOD studied in [6], for which an optimal solution was given without the privacy constraint. The second condition was first studied in [8] and was motivated by the need to keep content privacy is some distribution networks. This paper proposes both converse and achievable bounds. The proposed achievable scheme not only strictly outperforms the one in [8] for some values of the system parameters, but it is also information theoretically optimal in some settings. For the remaining cases, the proposed linear code is shown to require at most one more transmission than the converse bound derived by restricting the sender to only use linear codes.

show abstract

Private Broadcasting: An index coding approach

Cited by 18 publications

References 14 publications

On the Capacity Region for Secure Index Coding

On the Capacity Region for Secure Index Coding

Privacy in Index Coding: Improved Bounds and Coding Schemes

Private Pliable Index Coding

Contact Info

Product

Resources

About