Coded caching for resolvable networks with security requirements

Abstract

We consider networks where a set of end users, equipped with cache memories, are connected to a single server via a set of relay nodes. We further consider a special class of such networks that satisfy the so called resolvability property and study centralized coded caching scenarios under three security requirements. Under the first scenario, i.e., secure delivery, the wiretapper should not gain any information about the database files from the transmitted signals over the network links. In the second scenario, i.e., secure coded caching, we consider the case where users should not be able to obtain any information about files that they did not request. In the third scenario, the system requires both secure delivery and secure coded caching. We provide achievable schemes by jointly optimizing the cache placement and delivery phases, utilizing secret sharing and one-time pads. We provide numerical results to compare performance under these different requirements.