Coded Caching With Private Demands and Caches
Coded Caching With Private Demands and Caches
复制标题
DOI：
10.1109/isit50566.2022.9834846
复制
发表时间：
2022-01
期刊：
影响因子：
--
通讯作者：
A. Gholami;Kai Wan;Hua Sun;Mingyue Ji;G. Caire
中科院分区：
文献类型：
--
作者：
A. Gholami;Kai Wan;Hua Sun;Mingyue Ji;G. Caire
在编码缓存文献中，隐私的概念只被认为是针对需求的。基于真实的通信系统中多轮传输几乎无处不在的特点，提出了一种带私有需求和缓存的编码缓存问题。只有一个现有的私有缓存方案，这是基于引入虚拟用户，可以保持隐私的需求和缓存同时，但在一个非常大的子分组化指数的产品中的用户（K）和文件（N）的系统中。为了在满足隐私约束的同时减少子分组，我们提出了一种新的方法，通过私有信息检索（PIR）构建私有编码缓存方案。基于这种方法，我们提出了新的计划，私人需求和缓存有一个子分组化水平的顺序指数与K，而不是NK的虚拟用户计划。作为一个副产品，对于编码缓存问题的私人需求，私人编码缓存方案可以从所提出的方法，这通常改善了Yan和Tuninetti的私人编码缓存方案的内存负载权衡。
In the coded caching literature, the notion of privacy is considered only against demands. On the motivation that multi-round transmissions almost appear everywhere in real communication systems, this paper formulates the coded caching problem with private demands and caches. Only one existing private caching scheme, which is based on introducing virtual users, can preserve the privacy of demands and caches simultaneously, but at the cost of an extremely large subpacketization exponential in the product of the number of users (K) and files (N) in the system. In order to reduce the subpacketization while satisfying the privacy constraints, we propose a novel approach which constructs private coded caching schemes through private information retrieval (PIR). Based on this approach, we propose novel schemes with private demands and caches which have a subpacketization level in the order exponential with K instead of NK in the virtual user scheme. As a by-product, for the coded caching problem with private demands, a private coded caching scheme could be obtained from the proposed approach, which generally improves the memory-load tradeoff of the private coded caching scheme by Yan and Tuninetti.