Device-to-Device Secure Coded Caching
Device-to-Device Secure Coded Caching
复制标题
DOI：
10.1109/tifs.2019.2940885
复制
发表时间：
2018-09
影响因子：
6.8
通讯作者：
Ahmed A. Zewail;A. Yener
中科院分区：
文献类型：
--
作者：
Ahmed A. Zewail;A. Yener
本文研究了具有信息论安全保证的设备到设备（D2D）编码缓存。被认为是一个广播网络组成的服务器，它有一个图书馆的文件，并配备了高速缓存存储器的终端用户。信息理论的保密性安全保证强加在文件上。服务器填充终端用户高速缓存，之后D2D通信使得能够递送所请求的文件。因此，我们要求用户不得访问其未请求的文件，即，安全缓存。首先，通过联合优化缓存该高速缓存放置和递送策略，提供集中式编码缓存方案。接下来，一个分散的编码缓存方案的开发，不需要在缓存阶段的活跃用户的数量的知识。这两种方案都利用非完美秘密共享和一次性密钥，以保证安全的缓存。此外，所提出的方案提供安全递送作为附带益处，即，在传递阶段期间偷听到所发送的信号的任何外部实体不能获得关于数据库文件的任何信息。所提出的方案提供了可实现的最小交付和速率的上限。所需的传输和速率的下限也来自使用割集参数指示的下限和上限之间的乘法间隙。数值结果表明，差距随着存储器尺寸的增加而消失。总的来说，这项工作证明了D2D通信在高速缓存辅助系统中的有效性，即使在参与节点和外部窃听者处施加机密性约束。
This paper studies device to device (D2D) coded-caching with information theoretic security guarantees. A broadcast network consisting of a server, which has a library of files, and end users equipped with cache memories, is considered. Information theoretic security guarantees for confidentiality are imposed upon the files. The server populates the end user caches, after which D2D communications enable the delivery of the requested files. Accordingly, we require that a user must not have access to files it did not request, i.e., secure caching. First, a centralized coded caching scheme is provided by jointly optimizing the cache placement and delivery policies. Next, a decentralized coded caching scheme is developed that does not require the knowledge of the number of active users during the caching phase. Both schemes utilize non-perfect secret sharing and one-time pad keying, to guarantee secure caching. Furthermore, the proposed schemes provide secure delivery as a side benefit, i.e., any external entity which overhears the transmitted signals during the delivery phase cannot obtain any information about the database files. The proposed schemes provide the achievable upper bound on the minimum delivery sum rate. Lower bounds on the required transmission sum rate are also derived using cut-set arguments indicating the multiplicative gap between the lower and upper bounds. Numerical results indicate that the gap vanishes with increasing memory size. Overall, the work demonstrates the effectiveness of D2D communications in cache-aided systems even when confidentiality constraints are imposed at the participating nodes and against external eavesdroppers.