Multiaccess Coded Caching with Private Demands
Dequan Liang, Kai Wan, Minquan Cheng, Giuseppe Caire

TL;DR
This paper introduces a privacy-preserving approach for multiaccess coded caching, ensuring users only access their own demands by using private keys at cache-nodes, enhancing data privacy in shared network systems.
Contribution
The paper proposes a novel transformation method that converts existing non-private multiaccess coded caching schemes into private schemes using private keys.
Findings
Achieves user demand privacy in multiaccess caching.
Provides a systematic transformation approach.
Ensures only required files are accessible to users.
Abstract
Recently Hachem et al. formulated a multiaccess coded caching model which consists of a central server connected to users via an error-free shared link, and cache-nodes. Each cache-node is equipped with a local cache and each user can access neighbouring cache-nodes with a cyclic wrap-around fashion. In this paper, we take the privacy of the users' demands into consideration, i.e., each user can only get its required file and can not get any information about the demands of other users. By storing some private keys at the cache-nodes, we propose a novel transformation approach to transform a non-private multiaccess coded caching scheme into a private multiaccess coded caching scheme.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Mobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks
