@inproceedings{aac777264c53459bb31617e41b6c863e,
title = "Staircase-PIR: Universally robust private information retrieval",
abstract = "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.",
author = "Rawad Bitar and {El Rouayheb}, Salim",
note = "Funding Information: This work was supported in part by NSF Grant CCF 1817635. The authors are with the ECE department of Rutgers University, Piscataway, New Jersey. Emails: firstname.lastname@rutgers.edu. Funding Information: This work was supported in part by NSF Grant CCF 1817635. Publisher Copyright: {\textcopyright} 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.; 2018 IEEE Information Theory Workshop, ITW 2018 ; Conference date: 25-11-2018 Through 29-11-2018",
year = "2019",
month = jan,
day = "15",
doi = "10.1109/ITW.2018.8613532",
language = "English (US)",
series = "2018 IEEE Information Theory Workshop, ITW 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",
address = "United States",
}