arXiv (All)
open access
Improved Characterization of the Memory-Rate Tradeoff for Demand-Private Coded Caching With Multiple Demands
We consider a coded caching problem with multiple demands under a privacy constraint. In this problem, a server with access to $N$ files serves $K$ users over a shared link, and each user requests $L$ distinct files. The privacy constraint requires that each user obtain no information about the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Onyx: Cost-Efficient Disk-Oblivious ANN Search#123957
- Local Private Information Retrieval for Graph-Based Replicated Systems#819169
- Local Private Information Retrieval for Graph-Based Replicated Systems#809177
- Near-Optimal Generalized Private Testing#216744
- The law of data (privacy) protection: a comparative and theoretical study#461811
Record · ID 1202035
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive