Multiaccess Coded Caching with Private Demands
Kai Wan, Minquan Cheng, Dequan Liang, Giuseppe Caire · 2022 IEEE International Symposium on Information Theory (ISIT) · 2022
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-node is equipped with a local cache and each user can access L neighbouring cache-nodes in a cyclic wraparound fashion. In this paper, we take the privacy of the users’ demands into consideration, i.e., each user, while retrieving its own demanded file, cannot obtain any information on the demands of the other users. By storing some private keys at the cache-nodes, we develop a novel transformation approach to turn any non-private coded caching scheme (satisfying some constraints) into a private one.