Robust private information retrieval on coded data

By Razane Tajeddine, Salim el Rouayheb. 2017

41 citations recorded by the source corpus.

We consider the problem of designing PIR scheme on coded data when certain nodes are unresponsive. We provide the construction of ν-robust PIR schemes that can tolerate up to ν unresponsive nodes. These schemes are adaptive and universally optimal in the sense of achieving (asymptotically) optimal download cost for any number of unresponsive nodes up to ν.

Subfields: Artificial Intelligence

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Staircase-PIR: Universally Robust Private Information Retrieval (2018, methodology): “In [26] the authors present a universally robust PIR scheme for the no collusion case and when the data is stored on the servers using a maximum distance separable (MDS) code.”
Private Information Retrieval From MDS Coded Data in Distributed Storage Systems (2016, background): “Robust PIR was also studied in [19] and [20].”
Private Information Retrieval With Side Information (2017, background): “Recently, there has been a growing body of work studying PIR for coded data motivated by lower overhead of codes [11]–[18], [20], [21].”
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers (2018, methodology): “An adaptive robust PIR scheme on MDS coded data with non-responsive servers was devised in [21].”
Private information retrieval with side information: The single server case (2017, background): “Recently, there has been a growing body of work studying PIR for coded data motivated by lower overhead of codes [11]–[18], [20], [21].”