Multi-Access Cache-Aided Multi-User Private Information Retrieval
Kanishak Vaidya, and B Sundar Rajan

TL;DR
This paper introduces a new multi-access cache-aided multi-user PIR scheme that enhances privacy and efficiency in distributed data retrieval, especially when users access multiple cache nodes, extending prior single-user models.
Contribution
It proposes a novel MuPIR scheme utilizing multi-access cache setups, achieving order optimality for certain user-cache configurations and characterizing rates for cyclic arrangements.
Findings
Scheme is order optimal for K=binom(C,L) users.
Characterization of scheme rate for cyclic wraparound setup.
Extends single-user PIR to multi-access cache scenarios.
Abstract
We consider the problem of multi-access cache-aided multi-user Private Information Retrieval (MuPIR). In this problem, several files are replicated across multiple servers. There are users and cache nodes. Each user can access cache nodes, and every cache node can be accessed by several users. Each user wants to retrieve one file from the servers, but the users do not want the servers to know their demands. Before the users decide their respective demands, servers will fill the cache nodes from the content of the files. Users will then request their desired files from the servers. Servers will perform coded transmissions, and all the users should get their desired files from these transmissions and the content placed in the caches they are accessing. It is required that any individual server should not get any information about the demands of the users. This problem is an…
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
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Optimization and Search Problems
