On Coded Caching with Private Demands
share
Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the user's local cache memory without knowledge of later demands. For the shared-link caching model, Maddah-Ali and Niesen (MAN) proposed a two-phase (placement and delivery phases) coded caching strategy, which is order optimal within a constant factor. However, in the MAN scheme, each user can obtain the information about the demands of other users, i.e., the MAN scheme is inherently prone to tampering and spying the activity/demands of other users. In this paper, we formulate a shared-link caching model with private demands. Our goal is to design a two-phase private caching scheme with minimum load while preserving the privacy of the demands of each user with respect to other users. Two private caching schemes are proposed with some (order) optimality results. We also propose a private scheme to further reduce the transmitted load for the case where each user has a distinct request, e.g., in practical asynchronous streaming users always have distinct demands.
READ FULL TEXT