Multi-Access Coded Caching with Demand Privacy

by   K. K. Krishnan Namboodiri, et al.

The demand private coded caching problem in a multi-access network with K users and K caches, where each user has access to L neighbouring caches in a cyclic wrap-around manner, is studied. The additional constraint imposed is that one user should not get any information regarding the demands of the remaining users. A lifting construction of demand private multi-access coded caching scheme from conventional, non-private multi-access scheme is introduced. The demand-privacy for a user is ensured by placing some additional keys in a set of caches called the private set of that user. For a given K and L, a technique is also devised to find the private sets of the users.


page 1

page 2

page 3

page 4


Subpacketization in Coded Caching with Demand Privacy

Coded caching is a technique where we utilize multi-casting opportunitie...

Multiaccess Coded Caching with Private Demands

Recently Hachem et al. formulated a multiaccess coded caching model whic...

Fundamental Limits of Demand-Private Coded Caching

We consider the coded caching problem with an additional privacy constra...

Demand-Private Coded Caching and the Exact Trade-off for N=K=2

The distributed coded caching problem has been studied extensively in th...

Optimal, Truthful, and Private Securities Lending

We consider a fundamental dynamic allocation problem motivated by the pr...

Coded Caching with Private Demands and Caches

Coded caching has been shown as a promissing method to reduce the networ...

Demand Private Coded Caching

The work by Maddah-Ali and Niesen demonstrated the benefits in reducing ...