A content-delivery protocol, exploiting the privacy benefits of coded caching

Coded caching is a communications technique that has elevated the preemptive use of memory (caching) into a powerful ingredient in general communications networks, promising to change the way networking and PHY-based communications are conducted. At the same time though — because this approach is heavily dependent on cooperation between the content provider (CP), and a centralized powerful transmitter of information (ISP), and because it is heavily dependent on users caching a variety of content that is not their own — raises privacy concerns which have the potential to compromise the applicability of coded caching. What we are showing in this early work here, is that in fact coded caching carries a distinct set of salient features that in fact boost privacy. We present a step-by-step privacy-aware content-delivery protocol that utilizes caching and which — at a small cost in performance — can safeguard against unauthorized matching of users to their requests, as well as against unauthorized knowledge of the popularity statistics of files; both crucial privacy issues in different scenarios such as video on demand. These properties include multicasting-only transmissions for continuous obfuscation of the true destination of content, an almost seamless addition of phantom users that can skew the true popularity distribution, popularity-agnostic caches, cache-agnostic ISP, and an overall minimization of data traffic between CP and ISP, and between ISP and users.

[1]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[2]  Jaime Llorca,et al.  Finite-Length Analysis of Caching-Aided Coded Multicasting , 2014, IEEE Transactions on Information Theory.

[3]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[4]  Suhas N. Diggavi,et al.  Effect of number of users in multi-level coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[5]  Mérouane Debbah,et al.  On the benefits of edge caching for MIMO interference alignment , 2015, 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[6]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, Allerton.

[7]  Suhas N. Diggavi,et al.  Coded Caching for Heterogeneous Wireless Networks with Multi-level Access , 2014, ArXiv.

[8]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless video content delivery through distributed caching helpers , 2011, 2012 Proceedings IEEE INFOCOM.

[9]  Ben Smyth,et al.  CryptoCache: Network caching with confidentiality , 2017, 2017 IEEE International Conference on Communications (ICC).

[10]  Mérouane Debbah,et al.  Caching at the edge: A green perspective for 5G networks , 2015, 2015 IEEE International Conference on Communication Workshop (ICCW).

[11]  Jingjing Zhang,et al.  Coded caching for reducing CSIT-feedback in wireless communications , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Meixia Tao,et al.  Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[13]  T. Charles Clancy,et al.  Fundamental Limits of Caching With Secure Delivery , 2013, IEEE Transactions on Information Forensics and Security.

[14]  Michele A. Wigger,et al.  Joint cache-channel coding over erasure broadcast channels , 2015, 2015 International Symposium on Wireless Communication Systems (ISWCS).

[15]  Mehdi Bennis,et al.  A transfer learning approach for cache-enabled wireless networks , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[16]  Michael Gastpar,et al.  Information-Theoretic Caching: Sequential Coding for Computing , 2015, IEEE Transactions on Information Theory.

[17]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Vinod M. Prabhakaran,et al.  Fundamental limits of secretive coded caching , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[19]  Urs Niesen,et al.  Cache-aided interference channels , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[20]  Vinod M. Prabhakaran,et al.  Critical database size for effective caching , 2015, 2015 Twenty First National Conference on Communications (NCC).

[21]  Xiaohua Tian,et al.  Fundamental Limits of Heterogenous Cache , 2015, ArXiv.

[22]  Hooshang Ghasemi,et al.  Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[23]  Sheng Yang,et al.  Cache-enabled broadcast packet erasure channels with state feedback , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[24]  Urs Niesen,et al.  Caching in wireless networks , 2009, 2009 IEEE International Symposium on Information Theory.

[25]  Jaime Llorca,et al.  Order Optimal Coded Delivery and Caching: Multiple Groupcast Index Coding , 2014, ArXiv.