.png){kind=icon}
返回
Coded Caching With File and Demand Privacy
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2022.3184765.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter studies coded caching with file and demand privacy (f&d-privacy) which guarantees that each user learns no information neither about other users' demands, nor about non-demanded files. First, we prove that an f&d-private coded caching system can also resist the attacks of an external eavesdropper. We then characterize the exact memory-rate trade-off for N = K = 2. Finally, we propose coded caching schemes to achieve the minimal-memory point (M = 1, R = K), which is tight if N >= 2K, and the minimal-rate point (M = N(K - 1) + 1, R = 1) on the memory-rate trade-off.
Keyword:
Coded caching
file privacy
demand privacy
the memory-rate trade-off
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
.png){kind=icon}
没有更多内容