.png){kind=icon}
.png){kind=icon}
Return
Private Coded Caching
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2017.2765503.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent work by Maddah-Ali and Niesen (2014) introduced coded caching which demonstrated the benefits of joint design of storage and transmission policies in content delivery networks. They studied a setup where a server communicates with a set of users, each equipped with a local cache, over a shared error-free link and proposed an order-optimal caching and delivery scheme. In this paper, we introduce the problem of private coded caching where we impose the additional constraint that no user learns any information about the contents of the files it did not request from what is stored in its cache and the server transmissions. We propose a feasible scheme for this setting and demonstrate its order-optimality by deriving information-theoretic lower bounds.
Keywords:
Content distribution
coded caching
privacy
information theoretic security
decentralized coded caching
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W
View more organizations