A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching

02/02/2021
by   Xiang Zhang, et al.
0

In the problem of cache-aided multiuser private information retrieval (MuPIR), a set of K_ u cache-equipped users wish to privately download a set of messages from N distributed databases each holding a library of K messages. The system works in two phases: cache placement (prefetching) phase in which the users fill up their cache memory, and private delivery phase in which the users' demands are revealed and they download an answer from each database so that the their desired messages can be recovered while each individual database learns nothing about the identities of the requested messages. The goal is to design the placement and the private delivery phases such that the load, which is defined as the total number of downloaded bits normalized by the message size, is minimized given any user memory size. This paper considers the MuPIR problem with two messages, arbitrary number of users and databases where uncoded prefetching is assumed, i.e., the users directly copy some bits from the library as their cached contents. We propose a novel MuPIR scheme inspired by the Maddah-Ali and Niesen (MAN) coded caching scheme. The proposed scheme achieves lower load than any existing schemes, especially the product design (PD), and is shown to be optimal within a factor of 8 in general and exactly optimal at very high or low memory regime.

READ FULL TEXT
research
10/13/2020

On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval

We consider the problem of cache-aided Multiuser Private Information Ret...
research
06/04/2018

The Capacity of Private Information Retrieval with Private Side Information Under Storage Constraints

We consider the problem of private information retrieval (PIR) of a sing...
research
12/25/2022

On Cache-Aided Multi-User Private Information Retrieval with Small Caches

In this paper, we propose a scheme for the problem of cache-aided multi-...
research
12/18/2017

Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits

We consider the problem of private information retrieval (PIR) from N no...
research
06/22/2023

Cache-Aided Private Variable-Length Coding with Zero and Non-Zero Leakage

A private cache-aided compression problem is studied, where a server has...
research
01/22/2019

A New Design of Private Information Retrieval for Storage Constrained Databases

Private information retrieval (PIR) allows a user to download one of K m...
research
02/28/2018

Caching in Combination Networks: A Novel Delivery by Leveraging the Network Topology

Maddah-Ali and Niesen (MAN) in 2014 surprisingly showed that it is possi...

Please sign up or login with your details

Forgot password? Click here to reset