.png){kind=icon}
返回
Secretive Coded Caching With Shared Caches
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2021.3094405.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of secretive coded caching in a shared cache setup where the number of users accessing a particular helper cache is more than one, and every user can access exactly one helper cache. In secretive coded caching, the constraint of perfect secrecy must be satisfied. It requires that the users should not gain, either from their caches or from the transmissions, any information about the content of the files that they did not request from the server. In order to accommodate the secrecy constraint, our problem setup requires, in addition to a helper cache, a dedicated user cache of minimum capacity of 1 unit to every user. This is where our formulation differs from the original work on shared caches (Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching by E. Parrinello, A. unsal and P. Elia in Trans. Inf. Theory, 2020). In this work, we propose a secretively achievable coded caching scheme with shared caches under centralized placement. When our scheme is applied to the dedicated cache setting, it matches the scheme by Ravindrakumar et al. (Private Coded Caching, in Trans. Inf. Forensics and Security, 2018).
Keyword:
Servers
Libraries
Encoding
Indexes
Delays
Wireless communication
Prefetching
Coded caching
secretive coded caching
shared caches
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
分享收藏Interaction of .theta.-Toxin (Perfringolysin O), a Cholesterol-Binding Cytolysin, with Liposomal Membranes: Change in the Aromatic Side Chains upon Binding and Insertion.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏 没有更多内容
没有更多内容