Improved Memory-Rate Trade-off for Caching with Demand Privacy
Chinmay Gurjarpadhye, Jithin Ravi, Bikash Kumar Dey, Nikhil Karamchandani · 2021
We consider the demand-private coded caching problem in a noiseless broadcast network. It is known from past works that a demand-private scheme for N files and K users can be obtained from a non-private scheme for N files and NK users. We first propose a scheme that improves on this idea by removing some redundant transmissions. The memory- rate trade-off achieved using this scheme is shown to be within a multiplicative factor of 3 from the optimal for all the memory regimes when KK = 2.