Secure Multi-Access Coded Caching: A Lifting Approach
Abstract
We construct secure cyclic multi-access coded caching schemes by re-encoding the caches of a secure single-access scheme and reusing its multicast message unchanged. For a library of N files, each of K users reads L<K consecutive shared caches and must recover its requested file while learning no information about the other files. Starting from a parent scheme with a cyclic representation of its cached symbols, the transformation lets each access window recover the corresponding parent-cache symbols and, conditioned on them, learn nothing about the remaining symbols. A deterministic Pascal-window encoder handles symbols whose consecutive appearances span at least L users. A randomized complement-dual encoder handles shorter spans. Over a suitable finite field, these encoders attain the exact minimum per-block storage for every input length in the block-separable, parent-preserving class. Applying the transformation to two secure single-access schemes gives an achievable memory-rate family for N,K≥2 and 1≤ L<K, including the exact rate-one cache size $(N-1)(K-1)/L$. Using converse bounds for arbitrary secure multi-access schemes, we prove approximation guarantees for the achievable family and give a proof of the exact L=K−1 tradeoff.
Related
- Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
- The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
- Low-Subpacketization MIMO Coded Caching with Flexible Stream Allocation
- Hotplug Coded Caching: Uncoded versus Row-Wise Coded Placements
- Heterogeneous Demand-Private Coded Caching: Exact Characterization for Two Users and Two Files
BibTeX
@misc{fang2026secure,
title = {{Secure Multi-Access Coded Caching: A Lifting Approach}},
author = {Han Fang and Qinyi Lu and Nan Liu and Wei Kang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05136},
eprint = {2610.05136},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05136},
}
RIS
TY - UNPB
TI - Secure Multi-Access Coded Caching: A Lifting Approach
AU - Han Fang
AU - Qinyi Lu
AU - Nan Liu
AU - Wei Kang
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05136
UR - https://arxiv.org/abs/2610.05136
AB - We construct secure cyclic multi-access coded caching schemes by re-encoding the caches of a secure single-access scheme and reusing its multicast message unchanged. For a library of N files, each of K users reads L<K consecutive shared caches and must recover its requested file while learning no information about the other files. Starting from a parent scheme with a cyclic representation of its cached symbols, the transformation lets each access window recover the corresponding parent-cache symbols and, conditioned on them, learn nothing about the remaining symbols. A deterministic Pascal-window encoder handles symbols whose consecutive appearances span at least L users. A randomized complement-dual encoder handles shorter spans. Over a suitable finite field, these encoders attain the exact minimum per-block storage for every input length in the block-separable, parent-preserving class. Applying the transformation to two secure single-access schemes gives an achievable memory-rate family for N,K≥2 and 1≤ L<K, including the exact rate-one cache size $(N-1)(K-1)/L$. Using converse bounds for arbitrary secure multi-access schemes, we prove approximation guarantees for the achievable family and give a proof of the exact L=K−1 tradeoff.
ER -