Multi-Access Cache-Aided Multi-User Private Information Retrieval

In this paper we consider the problem of multi-access cache-aided multi-user Private Information Retrieval (MuPIR). In this problem, several files are replicated across multiple servers. There are multiple users and multiple cache nodes. Each user can access several cache nodes and every cache node can be accessed by several users. Each user wants to retrieve one file from the servers, but users don't want servers to know their demands. This problem is an extension of dedicated cache-aided MuPIR problem, which itself generalizes single user PIR setup. In this paper, we propose an order optimal MuPIR scheme that utilizes multi-access setup of the coded caching problem.