Coded Caching With File and Demand Privacy Articles uri icon

authors

  • QI, CHAO
  • Ravi, Jithin

publication date

  • September 2022

start page

  • 1979

end page

  • 1983

issue

  • 9

volume

  • 26

International Standard Serial Number (ISSN)

  • 1089-7798

Electronic International Standard Serial Number (EISSN)

  • 1558-2558

abstract

  • 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 Ngeq 2K , and the minimal-rate point (M=N(K-1)+1,R=1) on the memory-rate trade-off.

subjects

  • Telecommunications

keywords

  • coded caching; demand privacy; file privacy; the memory-rate trade-off