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

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. 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.

Improved Memory-Rate Trade-off for Caching with Demand Privacy

“…To this end, we present two novel achievability schemes. Then, by generalizing the converse bound presented in [4], we demonstrate that the achievable region given by these schemes is in fact the exact memory-rate trade-off.…”

“…As shown in prior works [2]- [4], an (N, K)-private scheme can be obtained from an (N, N K)-non-private scheme. We build on the ideas in these schemes and propose Scheme A.…”

“…The optimal rate for a non-private scheme is denoted by R * N,K (M ) and can be defined similarly as R * p N,K (M ). More details on the definition of a non-private coded caching scheme can be found in [4].…”

“…,t h e d em a n d so ft h eo t h e ru s e r sr em a i ni n f o rm a t i o n -t h e o r e t i c a l l y p r i v a t e f r om e a c hu s e r . I n [ 4 ] , i tw a s s h o w n t h a to n e c a no b t a i n ad em a n d -p r i v a t e s c h em e f o rN fi l e sa n dK u s e r s f r oman o np r i v a t e s c h em e f o rN fi l e sa n dNK u s e r sw h i c h s e r v e so n l ya s u b s e to fd em a n dv e c t o r s . W efi r s tp r o p o s ea s c h em e ( S c h em e A ) t h a tb u i l d so n t h i s f a c t .…”

“…W efi r s tp r o p o s ea s c h em e ( S c h em e A ) t h a tb u i l d so n t h i s f a c t . M em o r y -r a t ep a i r sa c h i e v a b l eu s i n g S c h em eAa r eg i v e n i nT h e o r em1 .T h e m em o r y -r a t ep a i r s i n T h e o r em1a r es h o w n t ob e w i t h i na m u l t i p l i c a t i v eg a po f3 f r om t h eo p t im a l f o r K <N ( T h e o r em2 ) .T h i s im p r o v e s s t a t e o f t h ea r to no r d e ro p t im a l i t y r e s u l t f r om [ 4 ]w h e r eag a po f 8w a ss h o w n .…”