Security and Privacy in Cache-Aided Linear Function Retrieval for Multi-access Coded Caching
Mallikharjuna Chinnapadamala, B. Sundar Rajan

TL;DR
This paper extends multi-access coded caching to include linear function retrieval, security, and privacy, proposing schemes that are near-optimal under certain memory conditions in a combinatorial topology network.
Contribution
It introduces secure and private linear function retrieval schemes for multi-access caching, generalizing previous models and achieving near-optimal rates under specific conditions.
Findings
Proposed secure, private, and improved schemes for linear function retrieval.
Schemes recover previous results as special cases.
Achieves near-optimal rates within a constant factor under certain memory conditions.
Abstract
A multi-access network consisting of files, caches, users with each user having access to a unique set of caches has been introduced recently by Muralidhar et al. ("Maddah-Ali-Niesen Scheme for Multi-access Coded Caching," in \textit{Proc. ITW}, 2021). It considers Single File Retrieval (SFR) i.e, each user demands an arbitrary file from the server. It proposes a coded caching scheme which was shown to be optimal under the assumption of uncoded placement by Brunero and Elia ("Fundamental Limits of Combinatorial Multi-Access Caching" in {\textit{arXiv:2110.07426} }). The above multi-access network is referred to as combinatorial topology which is considered in this work with three additional features : a) Linear Function Retrieval (LFR) i.e., each user is interested in retrieving an arbitrary linear combination of files in the server's library; b) Security i.e., the…
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 · Caching and Content Delivery
