On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes

07/01/2019
by   Swanand Kadhe, et al.
0

Private Information Retrieval (PIR) problem has recently attracted a significant interest in the information-theory community. In this problem, a user wants to privately download one or more messages belonging to a database with copies stored on a single or multiple remote servers. In the single server scenario, the user must have prior side information, i.e., a subset of messages unknown to the server, to be able to privately retrieve the required messages in an efficient way. In the last decade, there has also been a significant interest in Locally Recoverable Codes (LRC), a class of storage codes in which each symbol can be recovered from a limited number of other symbols. More recently, there is an interest in 'cooperative' locally recoverable codes, i.e., codes in which multiple symbols can be recovered from a small set of other code symbols. In this paper, we establish a relationship between coding schemes for the single-server PIR problem and LRCs. In particular, we show the following results: (i) PIR schemes designed for retrieving a single message are equivalent to classical LRCs; and (ii) PIR schemes for retrieving multiple messages are equivalent to cooperative LRCs. These equivalence results allow us to recover upper bounds on the download rate for PIR-SI schemes, and to obtain a novel rate upper bound on cooperative LRCs. We show results for both linear and non-linear codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

The Linear Capacity of Single-Server Individually-Private Information Retrieval with Side Information

This paper considers the problem of single-server Individually-Private I...
research
06/02/2018

Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information

This paper considers the problem of single-server single-message private...
research
05/12/2022

Single-Server Private Information Retrieval with Side Information Under Arbitrary Popularity Profiles

This paper introduces a generalization of the Private Information Retrie...
research
08/17/2018

Single-Server Multi-Message Private Information Retrieval with Side Information

We study the problem of single-server multi-message private information ...
research
08/14/2020

On single server private information retrieval in a coding theory perspective

In this paper, we present a new perspective of single server private inf...
research
12/13/2018

On the Capacity of Locally Decodable Codes

A locally decodable code (LDC) maps K source symbols, each of size L_w b...
research
07/21/2021

On the Modulus in Matching Vector Codes

A k-query locally decodable code (LDC) C allows one to encode any n-symb...

Please sign up or login with your details

Forgot password? Click here to reset