On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval
share
We consider the problem of cache-aided Multiuser Private Information Retrieval (MuPIR) which is an extension of the single-user cache-aided PIR problem to the case of multiple users. In MuPIR, each of the K_ u cache-equipped users wishes to privately retrieve a message out of K messages from N databases each having access to the entire message library. The privacy constraint requires that any individual database learns nothing about the demands of all users. The users are connected to each database via an error-free shared-link. In this paper, we aim to characterize the optimal trade-off between users' memory and communication load for such systems. Based on the proposed novel approach of cache-aided interference alignment (CIA), first, for the MuPIR problem with K=2 messages, K_ u=2 users and Nā„ 2 databases, we propose achievable retrieval schemes for both uncoded and general cache placement. The CIA approach is optimal when the cache placement is uncoded. For general cache placement, the CIA approach is optimal when N=2 and 3 verified by the computer-aided approach. Second, when K,K_ u and N are general, we propose a new product design (PD) which incorporates the PIR code into the linear caching code. The product design is shown to be order optimal within a multiplicative factor of 8 and is exactly optimal when the user cache memory size is large.
READ FULL TEXT
