# Multi-Access Coded Caching with Demand Privacy

Source: [Multi-Access Coded Caching with Demand Privacy](<https://www.sota2.com/research/paper/68fa58381e209131ce9ac502>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:12:38.356Z

Authors: K. K. Krishnan Namboodiri, B. Sundar Rajan

Published: 2021-07-01T05:47:08.000Z

## Abstract

The demand private coded caching problem in a multi-access network with $K$ users and $K$ caches, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is studied. The additional constraint imposed is that one user should not get any information regarding the demands of the remaining users. A lifting construction of demand private multi-access coded caching scheme from conventional, non-private multi-access scheme is introduced. The demand-privacy for a user is ensured by placing some additional \\textit{keys} in a set of caches called the \\textit{private set} of that user. For a given $K$ and $L$, a technique is also devised to find the private sets of the users.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2107.00226>)

[PDF](<https://arxiv.org/pdf/2107.00226.pdf>)