受限半径连接下的安全D2D编码缓存：通过提升方法
Secure D2D Coded Caching under Radius-Limited Connectivity via Lifting
浏览论文内容
中文总结 AI 辅助
本文针对半径受限的D2D缓存网络，提出基于提升的安全编码缓存方案，实现用户不泄露其他文件的同时恢复请求文件，并给出最优负载及近似最优的因子保证。
中文摘要 AI 辅助
安全设备到设备（D2D）缓存要求用户从自己的缓存中生成传输信号，并在不获取其他文件的情况下恢复所请求的文件。当通信仅限于附近用户时，我们构造了同时满足这两个要求的方案。网络由$K$个用户组成一个环，一个包含$N$个独立文件的库，以及一个接收半径$r$。传输使用一轮无噪声的正交本地广播，无需服务器传输。每个用户的缓存容量为$M$个文件单位。一个外部秘密共享码将文件份额分配给发送者，每个发送者的安全本地缓存方案传递所请求的份额。缓存预算包括发送者的库表示、随机状态和传输密钥。我们证明，尽管外部份额之间存在依赖关系，每个接收者的缓存和所有可听见的广播联合起来不会泄露关于未请求文件的任何信息。逆命题统计跨越连续用户块的传输，并利用保密性从熵界中移除一个用户的观察。令$h=2r$且$K\ge h+1$。私有编码缓存（PCC）实例化在$N>1$时，对于每个$M\ge Nh$，达到最小峰值总负载$K/h$。对于$N\ge K$，其内存共享包络在整个$M\in[N/h+2,Nh]$范围内与最优值相差不超过因子15。我们还应用无保密约束的提升方法，在$N\ge K$时，在$M\in[hN/(h+1),N]$上达到最优负载，并在$M\in[N/(h+1),N]$上保证因子$9/2$。
英文摘要
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$.
发表机构
- Southeast University（东南大学）
机构由 AI 辅助整理，请以论文原文为准。
