Demand-Private Coded Caching and the Exact Trade-off for N=K=2

e-Archivo Repository

Show simple item record Kamath, Sneha Ravikumaran Nair, Jithin Dey, Bikash Kumar 2021-11-02T13:11:47Z 2021-11-02T13:11:47Z 2020-02-21
dc.identifier.bibliographicCitation Kamath, S., Ravi, J. & Dey, B. K. (2020). Demand-Private Coded Caching and the Exact Trade-off for N=K=2. In: 2020 National Conference on Communications (NCC), 21-23 Feb. 2020.
dc.identifier.isbn 978-1-7281-5121-2
dc.description Proceedings of: National Conference on Communications (NCC), 21-23 Feb. 2020, Kharagpur, India.
dc.description.abstract The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is revealed to others in the delivery phase. In this paper, we consider the coded caching problem under the constraint that the demands of the other users remain information theoretically secret from each user. We first show that the memory-rate pair (M, min{ N, K}(1- M / N)) is achievable under information theoretic demand privacy, while using broadcast transmissions. Using this, we show that perfectly demand-private coded caching rate is order optimal for all parameter regimes. We then show that a demand-private scheme for N files and K users can be obtained from a non-private scheme that satisfies only a restricted subset of demands of N K users for N files. We then focus on the demand-private coded caching problem for K = 2 users, N = 2 files. We characterize the exact memory-rate trade-off for this case. To show the achievability, we use our first result to construct a demand-private scheme from a non-private scheme satisfying a restricted demand subset that is known from an earlier work by Tian. Further, by giving a converse based on the extra requirement of privacy, we show that the obtained achievable region is the exact memory-rate trade-off.
dc.description.sponsorship J. Ravi 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, lIT Bombay.
dc.format.extent 6
dc.language.iso eng
dc.publisher IEEE
dc.rights © 2020, IEEE
dc.subject.other Cache storage
dc.subject.other Data privacy
dc.title Demand-Private Coded Caching and the Exact Trade-off for N=K=2
dc.type article
dc.type conferenceObject
dc.subject.eciencia Telecomunicaciones
dc.rights.accessRights openAccess
dc.relation.projectID info:eu-repo/grantAgreement/EC/714161
dc.type.version acceptedVersion
dc.relation.eventdate 2020-02-21
dc.relation.eventplace Kharagpur, India
dc.relation.eventtitle 2020 National Conference on Communications (NCC)
dc.relation.eventtype proceeding
dc.identifier.publicationfirstpage 1
dc.identifier.publicationlastpage 6
dc.identifier.publicationtitle 2020 National Conference on Communications (NCC)
dc.identifier.uxxi CC/0000032742
dc.contributor.funder European Commission
dc.affiliation.dpto UC3M. Departamento de Teoría de la Señal y Comunicaciones
dc.affiliation.grupoinv UC3M. Grupo de Investigación: Tratamiento de la Señal y Aprendizaje (GTSA)
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)

This item appears in the following Collection(s)

Show simple item record