Secretive Coded Caching from PDAs

TL;DR

This paper introduces a secretive coded caching scheme utilizing Placement Delivery Arrays (PDAs) to achieve low subpacketization levels, improving privacy and efficiency in centralized cache networks.

Contribution

It proposes a novel secretive coded caching scheme based on PDAs that reduces subpacketization levels compared to previous exponential solutions.

Findings

Achieves low subpacketization in secretive caching

Recovers known schemes when applied to MN PDA

Enhances privacy in centralized caching systems

Abstract

The coded caching problem with secrecy constraint i.e., the users should not be able to gain any information about the content of the files that they did not demand, is known as the secretive coded caching problem. This was proposed by Ravindrakumar et al. in the paper titled ``Private Coded Caching'' that appeared in \emph{ IEEE Transactions on Information Forensics and Security}, 2018 and is characterised by subpacketization levels growing exponentially with the number of users. In the context of coded caching without secrecy, coded caching schemes at subexponential subpacketization levels are feasible by representing the caching system in the form of a Placement Delivery Array (PDA) and designing placement and delivery policies from it. Motivated by this, we propose a secretive coded caching scheme with low subpacketization using PDA, for users with dedicated caches in the centralized setting. When our scheme is applied to a special class of PDA known as MN PDA, the scheme proposed by Ravindrakumar et al. is recovered.