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

01/27/2022
by   Kanishak Vaidya, et al.
0

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 K users and C cache nodes. Each user can access L cache nodes, and every cache node can be accessed by several users. Each user wants to retrieve one file from the servers, but the users do not want the servers to know their demands. Before the users decide their respective demands, servers will fill the cache nodes from the content of the files. Users will then request their desired files from the servers. Servers will perform coded transmissions, and all the users should get their desired files from these transmissions and the content placed in the caches they are accessing. It is required that any individual server should not get any information about the demands of the users. This problem is an extension of the dedicated cache-aided MuPIR problem, which itself generalizes the widely studied single user PIR setup. In this paper, we propose a MuPIR scheme which utilizes a multi-access setup of the coded caching problem. The presented scheme is order optimal when K=CL users. We also characterize the rate of the scheme for the special case of cyclic wraparound multi-access setup, where C=K and each user access L consecutive cache nodes in cyclic wraparound fashion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2022

Cache-Aided Multi-User Private Information Retrieval using PDAs

We consider the problem of cache-aided multi-user private information re...
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
05/13/2021

Multiaccess Coded Caching with Private Demands

Recently Hachem et al. formulated a multiaccess coded caching model whic...
research
02/06/2021

Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers

This paper investigates the ultimate performance limits of Linear Functi...
research
07/09/2019

Analysing Censorship Circumvention with VPNs via DNS Cache Snooping

Anecdotal evidence suggests an increasing number of people are turning t...
research
02/11/2022

Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs

We study the problem of multi-access coded caching (MACC): a central ser...
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...

Please sign up or login with your details

Forgot password? Click here to reset