Can I read Multi-Server Private Information Retrieval with Coded Side Information on EtoBox?

Multi-Server Private Information Retrieval with Coded Side Information by Kazemi, Fatemeh; Karimi, Esmaeil; Heidarzadeh, Anoosheh; Sprintson, Alex is a scholarly article available to read on EtoBox.

What is Multi-Server Private Information Retrieval with Coded Side Information about?

In this paper, we study the multi-server setting of the \emph{Private Information Retrieval with Coded Side Information (PIR-CSI)} problem. In this problem, there are $K$ messages replicated across $N$ servers, and there is a user who wishes to download one message from the servers without revealing any information to any server about the identity of the requested message. The user has a side information which is a linear combination of a subset of $M$ messages in the database. The parameter $M$ is known to all servers in advance, whereas the indices and the coefficients of the messages in the user's side information are unknown to any server \emph{a priori}. We focus on a class of PIR-CSI schemes, referred to as \emph{server-symmetric schemes}, in which the queries/answers to/from different servers are symmetric in structure. We define the \emph{rate} of a PIR-CSI scheme as its minimum download rate among all problem instances, and define the \emph{server-symmetric capacity} of the PIR-CSI problem as the supremum of rates over all server-symmetric PIR-CSI schemes. Our main results are as follows: (i) when the side information is not a function of the user's requested message, the

Author

Kazemi, Fatemeh; Karimi, Esmaeil; Heidarzadeh, Anoosheh; Sprintson, Alex

Published

2019

Language

EN