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 …

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

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 …

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

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 …

In the coded caching problem, as originally formulated by Maddah-Ali and Niesen, a server
communicates via a noiseless shared broadcast link to multiple users that have local …

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

Coded Caching is an efficient technique to reduce peak-hour network traffic. One limitation
of known coded caching schemes is that the demands of all users are revealed to their …

Optimizing data traffic is a key concern in content distribution networks to reduce the
bandwidth needed to serve the requested content to the final users. In this context …