Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
Abstract
Secure device-to-device (D2D) caching requires users to generate delivery signals from their own caches and to recover their requested files without learning the other files. We construct schemes that meet both requirements when communication is limited to nearby users. The network consists of K users on a cycle, a library of N independent files, and a reception radius r. Delivery uses one round of noiseless orthogonal local broadcasts, with no server transmission. Each user's cache has capacity M file units. An outer secret-sharing code assigns file shares to senders, and a secure local caching scheme at each sender delivers the requested shares. The cache budget includes the sender's library representation, random state, and delivery keys. We prove that each receiver's cache and all audible broadcasts jointly reveal no information about nonrequested files, despite the dependence between the outer shares. The converse counts transmissions crossing a contiguous user block and uses secrecy to remove one user's observation from the entropy bound. Let h=2r and K≥ h+1. The private coded caching (PCC) instantiation attains the minimum peak sum load K/h for every M≥ Nh when N>1. For N≥ K, its memory-sharing envelope is within a factor $15$ of the optimum throughout M∈[N/h+2,Nh]. We also apply lifting without secrecy constraints, achieving the optimal load on M∈[hN/(h+1),N] and a factor-9/2 guarantee on M∈[N/(h+1),N] when N≥ K.
Related
- Secure Multi-Access Coded Caching: A Lifting Approach
- The Exact Memory-Rate Tradeoff for Three-User Secure Coded Caching
- Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
- Independence number, essential connectivity and the distance spectral radius of graphs
- The Algebraic Connectivity and Laplacian Spectral Radius of Token Graphs
BibTeX
@misc{fang2026secure,
title = {{Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting}},
author = {Han Fang and Nan Liu and Wei Kang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05065},
eprint = {2610.05065},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05065},
}
RIS
TY - UNPB
TI - Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
AU - Han Fang
AU - Nan Liu
AU - Wei Kang
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05065
UR - https://arxiv.org/abs/2610.05065
AB - Secure device-to-device (D2D) caching requires users to generate delivery signals from their own caches and to recover their requested files without learning the other files. We construct schemes that meet both requirements when communication is limited to nearby users. The network consists of K users on a cycle, a library of N independent files, and a reception radius r. Delivery uses one round of noiseless orthogonal local broadcasts, with no server transmission. Each user's cache has capacity M file units. An outer secret-sharing code assigns file shares to senders, and a secure local caching scheme at each sender delivers the requested shares. The cache budget includes the sender's library representation, random state, and delivery keys. We prove that each receiver's cache and all audible broadcasts jointly reveal no information about nonrequested files, despite the dependence between the outer shares. The converse counts transmissions crossing a contiguous user block and uses secrecy to remove one user's observation from the entropy bound. Let h=2r and K≥ h+1. The private coded caching (PCC) instantiation attains the minimum peak sum load K/h for every M≥ Nh when N>1. For N≥ K, its memory-sharing envelope is within a factor $15$ of the optimum throughout M∈[N/h+2,Nh]. We also apply lifting without secrecy constraints, achieving the optimal load on M∈[hN/(h+1),N] and a factor-9/2 guarantee on M∈[N/(h+1),N] when N≥ K.
ER -