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 …

Placement delivery arrays for distributed computing (Comp-PDAs) have recently been
proposed as a framework to construct universal computing schemes for MapReduce-like …

Hachem et al. formulated a multiaccess coded caching model which consists of a central
server connected to K users via an error-free shared link, and K cache-nodes. Each cache …

We consider the problem of cache-aided Multiuser Private Information Retrieval (MuPIR)
which is an extension of the single-user cache-aided PIR problem to the case of multiple …

This work investigates a system where each user aims to retrieve a scalar linear function of
the files of a library, which are Maximum Distance Separable coded and stored at multiple …

We consider the coded caching problem with an additional privacy constraint that a user
should not get any information about the demands of the other users. We first show that a …

The distributed coded caching problem has been studied extensively in the recent past.
While the known coded caching schemes achieve an improved transmission rate, they …

This work investigates the problem of cache-aided content Secure and demand Private
Linear Function Retrieval (SP-LFR), where three constraints are imposed on the system:(a) …

In order to preserve the privacy of the users demands from other users, in this paper we
formulate a novel information theoretic Device-to-Device (D2D) private caching model by …

Coded caching is a technique where multicasting and coding opportunities are utilized to
achieve better rate-memory tradeoff in cached networks. A crucial parameter in coded …