Fundamental limits of caching with secure delivery

Avik Sengupta, Ravi Tandon, T. Charles Clancy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Caching is a procedure which allows popular files to be pre-fetched and stored partly in end users' memory. In modern wireless networks, caching is emerging to play a vital role in reducing peak data rates by storing popular content. In this paper, the concept of information theoretic security for caching is introduced. A novel caching scheme is proposed which leverages both the local and global caching gains to reduce peak rate while securely delivering requested content to the users. The analysis of the secure caching problem is presented which shows that the proposed scheme introduces security at negligible cost compared to insecure caching schemes, particularly for large number of files and users. It is also shown that the rate of the proposed scheme is within a constant multiplicative factor from the information-theoretic optimal rate for all feasible values of problem parameters.

Original languageEnglish (US)
Title of host publication2014 IEEE International Conference on Communications Workshops, ICC 2014
PublisherIEEE Computer Society
Pages771-776
Number of pages6
ISBN (Print)9781479946402
DOIs
StatePublished - 2014
Externally publishedYes
Event2014 IEEE International Conference on Communications Workshops, ICC 2014 - Sydney, NSW, Australia
Duration: Jun 10 2014Jun 14 2014

Publication series

Name2014 IEEE International Conference on Communications Workshops, ICC 2014

Conference

Conference2014 IEEE International Conference on Communications Workshops, ICC 2014
Country/TerritoryAustralia
CitySydney, NSW
Period6/10/146/14/14

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Fundamental limits of caching with secure delivery'. Together they form a unique fingerprint.

Cite this