On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers

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

6 Citations (Scopus)

Abstract

In this work, we first prove the capacity of coded, linear symmetric private information retrieval (SPIR) in the presence of colluding, adversarial, and nonresponsive servers, giving a positive closure to the conjecture stated by Tajeddine et al. It is also shown that, further restricting to strongly-linear PIR schemes with linear interference cancellation, the so-called star product scheme proposed by Freij-Hollanti et al. is optimal. This observation enables to prove the capacity of strongly-linear (non-symmetric) PIR schemes for any number of files. Further, it also provides a positive proof in this practical special case for the conjectures stated in the asymptotic regime by Freij-Hollanti et al. and Tajeddine et al.

Original languageEnglish
Title of host publication2019 IEEE Information Theory Workshop, ITW 2019
PublisherIEEE
ISBN (Electronic)9781538669006
DOIs
Publication statusPublished - Aug 2019
MoE publication typeA4 Article in a conference publication
EventIEEE Information Theory Workshop - Visby, Sweden
Duration: 25 Aug 201928 Aug 2019

Conference

ConferenceIEEE Information Theory Workshop
Abbreviated titleITW
CountrySweden
CityVisby
Period25/08/201928/08/2019

Fingerprint Dive into the research topics of 'On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers'. Together they form a unique fingerprint.

Cite this