Coded Caching with Private Demands and Caches

Abstract

Coded caching has been shown as a promissing method to reduce the network load in peak-traffic hours. In the coded caching literature, the notion of privacy is considered only against demands. On the motivation that multi-round transmissions almost appear everywhere in real communication systems, this paper formulates the coded caching problem with private demands and caches. Only one existing private caching scheme, which is based on introducing virtual users, can preserve the privacy of demands and caches simultaneously, but with an extremely large subpacketization exponential to the product of the numbers of users and files in the system. In order to reduce the subpacketization while satisfying the privacy constraint, we propose a novel approach which constructs private coded caching schemes through private information retrieval (PIR). Based on this approach, we propose novel schemes with private demands and caches which have a subpacketization level in the order exponential to K (number of users) against N K in the virtual user scheme where N stands for the numbers of files. As a by-product, for the coded caching problem with private demands, a private coded caching scheme could be obtained from the proposed approach, which generally improves the memoryload tradeoff of the private coded caching scheme by Yan and Tuninetti.