Lifting Private Information Retrieval from Two to any Number of Messages

02/18/2018
by   Rafael G. L. D'Oliveira, et al.
0

We study private information retrieval (PIR) on coded data with possibly colluding servers. Devising PIR schemes with optimal download rate in the case of collusion and coded data is still open in general. We provide a lifting operation that can transform what we call one-shot PIR schemes for two messages into schemes for any number of messages. We apply this lifting operation on existing PIR schemes and describe two immediate implications. First, we obtain novel PIR schemes with improved download rate in the case of MDS coded data and server collusion. Second, we provide a simplified description of existing optimal PIR schemes on replicated data as lifted secret sharing based PIR.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2018

Staircase-PIR: Universally Robust Private Information Retrieval

We consider the problem of designing private information retrieval (PIR)...
research
10/12/2018

One-Shot PIR: Refinement and Lifting

We study a class of private information retrieval (PIR) methods that we ...
research
02/22/2018

Achievable Rate of Private Function Retrieval from MDS Coded Databases

We study the problem of private function retrieval (PFR) in a distribute...
research
07/07/2022

Star Product PIR Schemes with Colluding Servers over Small Fields

Private Information Retrieval (PIR) was first proposed by B. Chor, O. Go...
research
01/29/2019

Private Polynomial Computation for Noncolluding Coded Databases

We consider private polynomial computation (PPC) over noncolluding coded...
research
11/19/2021

On the Download Rate of Homomorphic Secret Sharing

A homomorphic secret sharing (HSS) scheme is a secret sharing scheme tha...
research
05/20/2020

Coopetition Against an Amazon

This paper studies cooperative data-sharing between competitors vying to...

Please sign up or login with your details

Forgot password? Click here to reset