# Optimal Demand Private Coded Caching for Users with Small Buffers

Source: [Optimal Demand Private Coded Caching for Users with Small Buffers](<https://www.sota2.com/research/paper/68fa57cc1e209131ce9a8931>)

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

Data updated: 2025-10-25T14:56:36.005Z

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

Published: 2021-01-21T17:53:30.000Z

## Abstract

Coded Caching is an efficient technique to reduce peak hour network traffic. One limitation of known coded caching schemes is that the demands of all users are revealed to their peers in the delivery phase. Schemes that assure privacy for user demands are studied in recent past. Assuming that the users are equipped with caches of small memory sizes, the achievable rate under demand privacy constraints is investigated in this work. We present an MDS code based demand private coded caching scheme with $K$ users and $N$ files that achieves a memory rate pair $\\left(\\frac{1}{K(N-1)+1},N\\left(1-\\frac{1}{K(N-1)+1}\\right)\\right)$. The presented memory-rate pair meets the lower bound under demand-privacy requirements, proposed by Yan \\textit{et al.} in the recent work \\cite{c13}. By memory sharing this characterizes the exact rate-memory trade-off for the demand private coded caching scheme for cache memory $M\\in \\left\[0,\\frac{1}{K(N-1)+1}\\right\]$.

## 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/2101.08745>)

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