On the Fundamental Limits of Device-to-Device Private Caching under Uncoded Cache Placement and User Collusion

TL;DR

This paper investigates the fundamental limits of private device-to-device caching with uncoded placement, providing new bounds that are close to optimal even with user collusion, addressing privacy challenges in D2D networks.

Contribution

It introduces novel achievable and converse bounds for private D2D caching that are within a constant factor, advancing understanding of privacy constraints in such networks.

Findings

Bounds are within a constant factor of each other.

Privacy can be maintained even with colluding users.

New theoretical limits for private D2D caching are established.

Abstract

In the coded caching problem, as originally formulated by Maddah-Ali and Niesen, a server communicates via a noiseless shared broadcast link to multiple users that have local storage capability. In order for a user to decode its demanded file from the coded multicast transmission, the demands of all the users must be globally known, which may violate the privacy of the users. To overcome this privacy problem, Wan and Caire recently proposed several schemes that attain coded multicasting gain while simultaneously guarantee information theoretic privacy of the users' demands. In Device-to-Device (D2D) networks, the demand privacy problem is further exacerbated by the fact that each user is also a transmitter, which appears to be needing the knowledge of the files demanded by the remaining users in order to form its coded multicast transmission. This paper shows how to solve this seemingly infeasible problem. The main contribution of this paper is the development of novel achievable and converse bounds for D2D coded caching that are to within a constant factor of one another when privacy of the users' demands must be guaranteed even in the presence of colluding users.