Staircase-PIR: Universally Robust Private Information Retrieval

by   Rawad Bitar, et al.

We consider the problem of designing private information retrieval (PIR) schemes on data of m files replicated on n servers that can possibly collude. We focus on devising robust PIR schemes that can tolerate stragglers, i.e., slow or unresponsive servers. In many settings, the number of stragglers is not known a priori or may change with time. We define universally robust PIR as schemes that achieve asymptotic, in m, PIR capacity, i.e., asymptotically optimal download rate, simultaneously for any number of stragglers up to a given threshold. We introduce Staircase-PIR schemes and prove that they are universally robust. Towards that end, we establish an equivalence between robust PIR and communication efficient secret sharing.


page 1

page 2

page 3

page 4


Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure

We study the equivalence between non-perfect secret sharing (NSS) and sy...

Lifting Private Information Retrieval from Two to any Number of Messages

We study private information retrieval (PIR) on coded data with possibly...

One-Shot PIR: Refinement and Lifting

We study a class of private information retrieval (PIR) methods that we ...

On partial information retrieval: the unconstrained 100 prisoner problem

We consider the classical 100 Prisoner problem and its variant, involvin...

Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval

Low degree Reed-Muller codes are known to satisfy local decoding propert...

Private Inner Product Retrieval for Distributed Machine Learning

In this paper, we argue that in many basic algorithms for machine learni...

On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers

In this work, we first prove the capacity of coded, linear symmetric pri...