# Multi-Access Coded Caching with Secure Delivery

Source: [Multi-Access Coded Caching with Secure Delivery](<https://www.sota2.com/research/paper/68fa580e1e209131ce9aae3f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:06:35.186Z

Authors: K. K. Krishnan Namboodiri, B. Sundar Rajan

Published: 2021-05-12T12:06:55.000Z

## 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$.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2105.05611>)

[PDF](<https://arxiv.org/pdf/2105.05611.pdf>)