Citation:
Gurjarpadhye, C., Ravi, J., Dey, B. K. & Karamchandani, N. (2021). Improved Memory-Rate Trade-off for Caching with Demand Privacy. In: 2020 IEEE Information Theory Workshop (ITW), 11-15 April, 2020.
xmlui.dri2xhtml.METS-1.0.item-contributor-funder:
European Commission
Sponsor:
J. Ravi has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). The work of B. K. Dey was supported in part by the Bharti Centre for Communication in IIT Bombay. The work of N. Karamchandani is supported in part by a Science and Engineering Research Board (SERB) grant on "Content Caching and Delivery over Wireless Networks".
Project:
info:eu-repo/grantAgreement/EC/714161
Keywords:
Privacy
,
Conferences
,
Information theory
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 schemWe 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 K K = 2.[+][-]