Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes

Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, Camilla Hollanti

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference article in proceedingsScientificvertaisarvioitu

1 Sitaatiot (Scopus)

Abstrakti

This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous works on PIR schemes based on transitive non-MDS codes on one hand, and PIR from MDS-coded Byzantine and nonresponsive servers on the other hand. More specifically, a PIR scheme employing binary Reed-Muller (RM) codes tolerant to colluding, Byzantine, and non-responsive servers is constructed, and bounds for the achievable rates are derived under certain conditions. The construction of such schemes turns out to be much more involved than for MDS codes. Namely, the binary query vectors have to be selected with great care to hit the desired information sets, which is technically challenging as will be shown.

AlkuperäiskieliEnglanti
Otsikko2022 IEEE International Symposium on Information Theory, ISIT 2022
KustantajaIEEE
Sivut2839-2844
Sivumäärä6
ISBN (elektroninen)978-1-6654-2159-1
DOI - pysyväislinkit
TilaJulkaistu - 2022
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaIEEE International Symposium on Information Theory - Espoo, Suomi
Kesto: 26 kesäk. 20221 heinäk. 2022

Julkaisusarja

NimiIEEE International Symposium on Information Theory
ISSN (elektroninen)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
LyhennettäISIT
Maa/AlueSuomi
KaupunkiEspoo
Ajanjakso26/06/202201/07/2022

Sormenjälki

Sukella tutkimusaiheisiin 'Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä