The coded caching problem with secrecy constraint i.e., the users should not be able to gain any information about the content of the files that they did not demand, is known as the secretive coded caching problem. This was proposed by Ravindrakumar et al. in the paper titled ``Private Coded Caching'' that appeared in \emph{ IEEE Transactions on Information Forensics and Security}, 2018 and is characterised by subpacketization levels growing exponentially with the number of users. In the context of coded caching without secrecy, coded caching schemes at subexponential subpacketization levels are feasible by representing the caching system in the form of a Placement Delivery Array (PDA) and designing placement and delivery policies from it. Motivated by this, we propose a secretive coded caching scheme with low subpacketization using PDA, for users with dedicated caches in the centralized setting. When our scheme is applied to a special class of PDA known as MN PDA, the scheme proposed by Ravindrakumar et al. is recovered.
翻译:密码缓存问题与保密限制有关,即用户不能获得关于他们没有要求的文件内容的任何信息,这被称为秘密编码缓存问题。这是Ravindrakumamar等人在题为“私人编码Caching'”的文件中提出的,出现在2018年关于信息法证和安全的“Informph{IEEE交易”中,以子包装水平为特征,与用户数量成倍增长。在无机密的编码缓存方面,在亚爆炸性子包装级的次爆炸性封存计划是可行的,它代表了封存系统,并设计了它的放置和交付政策。受这个文件的驱使,我们提出了一个秘密编码缓存计划,使用PDA,用于集中环境中专用缓存的用户。当我们的计划适用于被称为MN PDA的特殊类PDA时,Ravindrakuma et al提出的计划被恢复。