Fundamental limits of caching with secure delivery

IEEE Transactions on Information Forensics and Security

Volumn 10, Issue 2, 2015, Pages 355-370

  Sengupta, Avik ^a   Tandon, Ravi ^a   Clancy, T Charles ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Caching; information theoretic security; multicast delivery

Indexed keywords

INFORMATION THEORY;

CACHING; CACHING SCHEME; CONTENT CENTRIC; DELIVERY MECHANISM; INFORMATION LEAKAGE; INFORMATION- THEORETIC SECURITIES; MULTIPLICATIVE FACTORS; TRANSMISSION RATES;

CACHE MEMORY;

EID: 84921326513     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2014.2375553     Document Type: Article

References (27)

1. A. Sengupta, R. Tandon, and T. C. Clancy, "Fundamental limits of caching with secure delivery," in Proc. Wireless Phys. Layer Secur. Workshop, IEEE Int. Conf. Commun. (ICC), Jun. 2014, pp. 771-776.
2. A. Sengupta, R. Tandon, and T. C. Clancy, "Decentralized caching with secure delivery," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun./Jul. 2014, pp. 41-45.
3. L. W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem," ACM Comput. Surv., vol. 14, no. 2, pp. 287-313, Jun. 1982.
4. K. C. Almeroth and M. H. Ammar, "The use of multicast delivery to provide a scalable and interactive video-on-demand service," IEEE J. Sel. Areas Commun., vol. 14, no. 6, pp. 1110-1122, Aug. 1996.
5. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Placement algorithms for hierarchical cooperative caching," J. Algorithms, vol. 38, no. 1, pp. 260-302, 2001.
6. I. Baev, R. Rajaraman, and C. Swamy, "Approximation algorithms for data placement problems," SIAM J. Comput., vol. 38, no. 4, pp. 1411-1429, Aug. 2008.
7. M. A. Maddah-Ali and U. Niesen, "Fundamental limits of caching," IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2856-2867, May 2014.
8. M. A. Maddah-Ali and U. Niesen, "Decentralized coded caching attains order-optimal memory-rate tradeoff," IEEE/ACM Trans. Netw., to be published.
9. U. Niesen and M. A. Maddah-Ali, "Coded caching with nonuniform demands," in Proc. IEEE Conf. Comput. Commun. Workshops (INFOCOM WKSHPS), Apr. 2014, pp. 221-226.
10. R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, "Online coded caching," in Proc. IEEE Int. Conf. Commun. (ICC), Jun. 2014, pp. 1878-1883.
11. U. Niesen and M. A. Maddah-Ali. (Jul. 2014). "Coded caching for delaysensitive content." [Online]. Available: http://arxiv.org/abs/1407.4489
12. N. Karamchandani, U. Niesen, M. Maddah-Ali, and S. Diggavi, "Hierarchical coded caching," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun./Jul. 2014, pp. 2142-2146.
13. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and Zipf-like distributions: Evidence and implications," in Proc. IEEE INFOCOM, vol. 1. Mar. 1999, pp. 126-134.
14. M. Ji, A. M. Tulino, J. Llorca, and G. Caire, "On the average performance of caching and coded multicasting with random demands," in Proc. 11th Int. Symp. Wireless Commun. Syst. (ISWCS), 2014, pp. 922-926.
15. M. Ji, G. Caire, and A. F. Molisch, "Optimal throughput-outage tradeoff in wireless one-hop caching networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 1461-1465.
16. N. Golrezaei, A. G. Dimakis, and A. F. Molisch, "Wireless device-todevice communications with distributed caching," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2012, pp. 2781-2785.
17. M. Ji, G. Caire, and A. Molisch, "Fundamental limits of distributed caching in D2D wireless networks," in Proc. IEEE Inf. Theory Workshop (ITW), Sep. 2013, pp. 1-5.
18. M. Ji, G. Caire, and A. F. Molisch. (May 2014). "Fundamental limits of caching in wireless D2D networks." [Online]. Available: http://arxiv.org/abs/1405.5336
19. N. Golrezaei, K. Shanmugam, A. G. Dimakis, A. F. Molisch, and G. Caire, "FemtoCaching: Wireless video content delivery through distributed caching helpers," IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8402-8413, Dec. 2013.
20. P. Blasco and D. Gündüz, "Learning-based optimization of cache content in a small cell base station," in Proc. IEEE Int. Conf. Commun. (ICC), Jun. 2014, pp. 1897-1903.
21. P. Blasco and D. Gündüz, "Multi-armed bandit optimization of cache content in wireless infostation networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2014, pp. 51-55.
22. A. Sengupta, S. Amuru, R. Tandon, R. M. Buehrer, and T. C. Clancy, "Learning distributed caching strategies in small cell networks," in Proc. 11th Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 917-921.
23. C. E. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol. 28, no. 4, pp. 656-715, Sep. 1949.
24. A. Sengupta, R. Tandon, and T. C. Clancy. (Dec. 2013). "Fundamental limits of caching with secure delivery." [Online]. Available: http://arxiv.org/abs/1312.3961
25. A. Sengupta, R. Tandon, and T. C. Clancy, "Secure caching with nonuniform demands," in Proc. IEEE Global Wireless Summit (GWS), May 2014, pp. 1-5.
26. M. Ji, A. M. Tulino, J. Llorca, and G. Caire. (2014). "Order optimal coded delivery and caching: Multiple groupcast index coding." [Online]. Available: http://arxiv.org/abs/1402.4572
27. T. M. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ, USA: Wiley, 1991