Secure local caching cuts communication load in device networks
Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
Information Theory
Summary
When lots of people with devices share files directly nearby, keeping those files secret from each other is tricky. The authors found a method to share parts of files so everyone gets what they want without learning about others' files, even though devices only talk to their close neighbors. They used special codes and careful planning to keep transmissions efficient and private. Their approach also nearly matches the best possible communication efficiency under these conditions.
What this means in practice
- •For mobile network engineers: Design device caching systems that securely share data locally on user devices to reduce overall network usage and maintain file privacy.
- •For internet of things (iot) developers: Enable IoT devices to securely exchange cached information with neighbors while limiting communication to nearby devices and protecting data confidentiality.
Authors
Han Fang, Nan Liu, Wei Kang
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\ge h+1$. The private coded caching (PCC) instantiation attains the minimum peak sum load $K/h$ for every $M\ge Nh$ when $N>1$. For $N\ge K$, its memory-sharing envelope is within a factor $15$ of the optimum throughout $M\in[N/h+2,Nh]$. We also apply lifting without secrecy constraints, achieving the optimal load on $M\in[hN/(h+1),N]$ and a factor-$9/2$ guarantee on $M\in[N/(h+1),N]$ when $N\ge K$.