Abstract
Caching is emerging as a vital tool for alleviating the severe capacity crunch in modern content-centric wireless networks. The main idea behind caching is to store parts of the popular content in end-users' memory and leverage the locally stored content to reduce peak data rates. By jointly designing content placement and delivery mechanisms, recent works have shown order-wise reduction in transmission rates in contrast to traditional methods. In this paper, we consider the secure caching problem with the additional goal of minimizing information leakage to an external wiretapper. The fundamental cache memory versus transmission rate tradeoff for the secure caching problem is characterized. Rather surprisingly, these results show that security can be introduced at a negligible cost, particularly for large number of files and users. It is also shown that the rate achieved by the proposed caching scheme with secure delivery is within a constant multiplicative factor from the information-theoretic optimal rate for almost all parameter values of practical interest.
Original language | English (US) |
---|---|
Article number | 6971188 |
Pages (from-to) | 355-370 |
Number of pages | 16 |
Journal | IEEE Transactions on Information Forensics and Security |
Volume | 10 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1 2015 |
Externally published | Yes |
Keywords
- Caching
- information theoretic security
- multicast delivery
ASJC Scopus subject areas
- Safety, Risk, Reliability and Quality
- Computer Networks and Communications