Staircase-PIR: Universally robust private information retrieval

Rawad Bitar, Salim El Rouayheb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


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 PIR capacity asymptotically in m and 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.

Original languageEnglish (US)
Title of host publication2018 IEEE Information Theory Workshop, ITW 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538635995
StatePublished - Jan 15 2019
Event2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China
Duration: Nov 25 2018Nov 29 2018

Publication series

Name2018 IEEE Information Theory Workshop, ITW 2018


Conference2018 IEEE Information Theory Workshop, ITW 2018

All Science Journal Classification (ASJC) codes

  • Information Systems


Dive into the research topics of 'Staircase-PIR: Universally robust private information retrieval'. Together they form a unique fingerprint.

Cite this