Multi-Access Coded Caching with Secure Delivery

TL;DR

This paper introduces a secure multi-access coded caching scheme that encrypts transmissions with a novel key placement method, ensuring security against wiretappers while maintaining near-optimal efficiency for certain system parameters.

Contribution

It proposes a new secure multi-access coded caching scheme with a novel key placement technique, achieving near-optimal rates against wiretappers for specific system configurations.

Findings

Scheme is secure against external wiretappers.

Achieves near-optimal rate within a constant factor for certain parameters.

Uses a novel key placement technique in caches.

Abstract

The multi-access variant of the coded caching problem in the presence of an external wiretapper is investigated . A multi-access coded caching scheme with $K$ users, $K$ caches and $N$ files, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is proposed, which is secure against the wiretappers. Each transmission in the conventional insecure scheme will be now encrypted by a random key. The proposed scheme uses a novel technique for the key placement in the caches. It is also shown that the proposed secure multi-access coded caching scheme is within a constant multiplicative factor from the information-theoretic optimal rate for $L\geq \frac{K}{2}$ and $N\geq 2K$.