Journal
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
Volume 13, Issue 3, Pages 685-694Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIFS.2017.2765503
Keywords
Content distribution; coded caching; privacy; information theoretic security; decentralized coded caching
Funding
- INSPIRE Faculty Fellowship from the Department of Science and Technology, Government of India
- IIT Bombay
- Department of Science and Technology, Government of India
- Information Technology Research Academy, Government of India [ITRA/15(64)/Mobile/USEAADWN/01]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
