Robust Private Information Retrieval on Coded Data

Razane Tajeddine, Salim El Rouayheb

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Abstract

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 ν.
Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory (ISIT)
PublisherIEEE
Pages1903-1907
ISBN (Electronic)978-1-5090-4096-4
DOIs
Publication statusPublished - 2017
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Eurogress Aachen, Aachen, Germany
Duration: 25 Jun 201730 Jun 2017
https://isit2017.org/

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
Country/TerritoryGermany
CityAachen
Period25/06/201730/06/2017
Internet address

Keywords

  • Privacy
  • Robustness
  • Servers
  • Information theory
  • Information retrieval
  • Indexes
  • Adaptation models

Fingerprint

Dive into the research topics of 'Robust Private Information Retrieval on Coded Data'. Together they form a unique fingerprint.

Cite this