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

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference article in proceedingsScientificvertaisarvioitu

11 Sitaatiot (Scopus)

Abstrakti

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.

AlkuperäiskieliEnglanti
Otsikko2019 IEEE Information Theory Workshop, ITW 2019
KustantajaIEEE
ISBN (elektroninen)9781538669006
DOI - pysyväislinkit
TilaJulkaistu - elok. 2019
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaIEEE Information Theory Workshop - Visby, Ruotsi
Kesto: 25 elok. 201928 elok. 2019

Workshop

WorkshopIEEE Information Theory Workshop
LyhennettäITW
Maa/AlueRuotsi
KaupunkiVisby
Ajanjakso25/08/201928/08/2019

Sormenjälki

Sukella tutkimusaiheisiin 'On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä