Recently Hachem et al. formulated a multiaccess coded caching model which consists of a central server connected to $K$ users via an error-free shared link, and $K$ cache-nodes. Each cache-node is equipped with a local cache and each user can access $L$ neighbouring cache-nodes with a cyclic wrap-around fashion. In this paper, we take the privacy of the users' demands into consideration, i.e., each user can only get its required file and can not get any information about the demands of other users. By storing some private keys at the cache-nodes, we propose a novel transformation approach to transform a non-private multiaccess coded caching scheme into a private multiaccess coded caching scheme.

翻译：最近Hachem等人开发了一个多存取编码缓存模型,该模型由中央服务器组成,通过无误共享链接连接到$K的用户,以及$K的缓存节点。每个缓存节点都配备了本地缓存点,每个用户都可以以循环环绕方式访问相邻的缓存节点。在本文中,我们考虑到用户需求的隐私,即每个用户只能获得所需的文件,无法获得关于其他用户需求的任何信息。通过在缓存节点存储一些私人密钥,我们提出一个新的转换方法,将非私人多存密码缓存计划转变为私人多存码缓存计划。