Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers

Razane Tajeddine, Oliver W. Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti

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

8 Citations (Scopus)
107 Downloads (Pure)


A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting. An explicit scheme using an [n, k] generalized Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b byzantine and r non-responsive servers, when n\geq n^{\prime}=(\nu+1)k+t+2b+r-1, for some integer \nu\geq 1. This scheme achieves a PIR rate of 1-\frac{k+2b+t+r-1}{n^{\prime}-r}. In the case where the capacity is known, namely when k=1, it is asymptotically capacity achieving as the number of files grows.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
Number of pages5
ISBN (Print)9781538647806
Publication statusPublished - 15 Aug 2018
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Vail, United States
Duration: 17 Jun 201822 Jun 2018


ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryUnited States

Fingerprint Dive into the research topics of 'Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers'. Together they form a unique fingerprint.

Cite this