{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:52:42Z","timestamp":1775145162478,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613532","type":"proceedings-article","created":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T19:39:34Z","timestamp":1547753974000},"page":"1-5","source":"Crossref","is-referenced-by-count":26,"title":["Staircase-PIR: Universally Robust Private Information Retrieval"],"prefix":"10.1109","author":[{"given":"Rawad","family":"Bitar","sequence":"first","affiliation":[]},{"given":"Salim El","family":"Rouayheb","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616144"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911179"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437805"},{"key":"ref30","article-title":"Staircase-PIR: Universally robust private information retrieval (extended version)","author":"bitar","year":"2018","journal-title":"arXiv preprint arXiv 1806 08825"},{"key":"ref34","article-title":"Centralized repair of multiple node failures with applications to communication efficient secret sharing","author":"rawat","year":"2016","journal-title":"arXiv preprint arXiv 1603 02895"},{"key":"ref10","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"arXiv preprint arXiv 1705 10464"},{"key":"ref11","article-title":"Polynomially coded regression: Optimal straggler mitigation via data encoding","author":"li","year":"2018","journal-title":"arXiv preprint arXiv 1805 09934"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.2"},{"key":"ref14","article-title":"A survey on private information retrieval","author":"gasarch","year":"2004","journal-title":"Bulletin of the EATCS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref28","article-title":"The capacity of private information retrieval from byzantine and colluding databases","author":"banawan","year":"2017","journal-title":"arXiv preprint arXiv 1706 01442"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437670"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282699"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2723019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483236"},{"key":"ref8","article-title":"Minimizing latency for secure coded computing using secret sharing via staircase codes","author":"bitar","year":"2018","journal-title":"arXiv preprint arxiv 1802 05807"},{"key":"ref7","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2015","journal-title":"arXiv preprint arXiv 1512 00327"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref9","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"Proc Neural Information Processing Systems (NIPS) Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref20","article-title":"Private information retrieval from coded databases with colluding servers","author":"freij-hollanti","year":"2016","journal-title":"arXiv preprint arXiv 1611 02062"},{"key":"ref22","article-title":"The capacity of private information retrieval from coded databases","author":"banawan","year":"2016","journal-title":"arXiv preprint arXiv 1609 08138"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006763"},{"key":"ref24","first-page":"326","article-title":"Robust information-theoretic private information retrieval","author":"beimel","year":"2002","journal-title":"International Conference on Security in Communication Networks"},{"key":"ref23","article-title":"The capacity of robust private information retrieval with colluding databases","author":"sun","year":"2016","journal-title":"arXiv preprint arXiv 1605 09090"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006860"},{"key":"ref25","first-page":"269","article-title":"Optimally robust private information retrieval","author":"devet","year":"2012","journal-title":"USENIX Security Symposium"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","location":"Guangzhou","start":{"date-parts":[[2018,11,25]]},"end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613532.pdf?arnumber=8613532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:46:38Z","timestamp":1643222798000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613532","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}