arXiv (All)
open access
Order-Optimal Coded Caching With File and Demand Privacy
We study coded caching with joint file and demand privacy: each user recovers its requested file while learning nothing about the remaining files and the other users' requests jointly. Let $N$ and $K$ be the numbers of files and users, and let $M$ and $R$ denote the cache memory and delivery rate, b
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
- SFDS: Selective File Disclosure System#361408
- A Hyperbolic Bound for File Retrieval in DNA-Based Data Storage#1130909
- Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes#1216745
- Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting#1201078
- Memory, privacy and the legitimate interest of the colectivity: Sesc Memórias and the General Personal Data Protection Law#1177014
Record · ID 1216080
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