We study the problem of Private Information Retrieval (PIR) in the presence of prior side
information. The problem setup includes a database of K independent messages possibly …

We consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases when the user is equipped with a cache that holds an uncoded fraction …

This article investigates the problem of demand privacy against colluding users for shared-
link coded caching systems, where no subset of users can learn any information about the …

Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

We consider the problem of private information retrieval (PIR) of a single message out of
messages from replicated and non-colluding databases where a cache-enabled user …

Coded caching is a technique where we utilize multi-casting opportunities to reduce rate in
cached networks. One limitation of coded caching schemes is that they reveal the demands …

In the classical model for (information theoretically secure) Private Information Retrieval
(PIR) due to Chor, Goldreich, Kushilevitz and Sudan, a user wishes to retrieve one bit of a …

We study the fundamental problem of index coding under an additional privacy constraint
that requires each receiver to learn nothing more about the collection of messages beyond …

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 …

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 …