Coded Caching With File and Demand Privacy
Chao Qi, Jithin Ravi · IEEE Communications Letters · 2022
This letter studies coded caching withfile 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 anf&d-privatecoded 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\geq 2K$, and the minimal-rate point$(M=N(K-1)+1,R=1)$on the memory-rate trade-off.