Demand Private Coded Caching

Abstract

The work by Maddah-Ali and Niesen demonstrated the benefits in reducing the transmission rate in a noiseless broadcast network by joint design of caching and delivery schemes. In their setup, each user learns the demands of all other users in the delivery phase. In this paper, we introduce the problem of demand private coded caching where we impose a privacy requirement that no user learns any information about the demands of other users. We provide an achievable scheme and compare its performance using the existing lower bounds on the achievable rates under no privacy setting. For this setting, when $N\le K$ we show that our scheme is order optimal within a multiplicative factor of 8. Furthermore, when $N>K$ and $M\ge N/K$, our scheme is order optimal within a multiplicative factor of 4.

arXiv comment14 pages, 3 figures

References in corpus (1)

• Fundamental Limits of Caching with Secure Delivery

Cited by in corpus (6)

• Subpacketization in Coded Caching with Demand Privacy
• Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval
• Fundamental Limits of Caching for Demand Privacy against Colluding Users
• A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching
• On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval
• Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers