Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.11492 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914478798405632 |
|---|---|
| author | Lu, Qinyi Liu, Nan Kang, Wei |
| author_facet | Lu, Qinyi Liu, Nan Kang, Wei |
| contents | 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 demands of the other users. We propose a new achievable scheme for arbitrary numbers of files and users. The scheme is obtained via a transformation from a non-private coded caching scheme under uncoded placement for \(N\) files and \(K \cdot \min\{N,KL\}\) users, where each user requests one file and the demands are restricted to a subset of all possible demands. We then derive a converse bound, and the proposed scheme is shown to be order optimal within a factor of 6 of this bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_11492 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Demand-Private Coded Caching With Multiple Demands Lu, Qinyi Liu, Nan Kang, Wei Information Theory 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 demands of the other users. We propose a new achievable scheme for arbitrary numbers of files and users. The scheme is obtained via a transformation from a non-private coded caching scheme under uncoded placement for \(N\) files and \(K \cdot \min\{N,KL\}\) users, where each user requests one file and the demands are restricted to a subset of all possible demands. We then derive a converse bound, and the proposed scheme is shown to be order optimal within a factor of 6 of this bound. |
| title | On Demand-Private Coded Caching With Multiple Demands |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.11492 |