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

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

doi:10.1109/ISIT50566.2022.9834654

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

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

Matematiikan ja systeemianalyysin laitos

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

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äiskieli	Englanti
Otsikko	2022 IEEE International Symposium on Information Theory, ISIT 2022
Kustantaja	IEEE
Sivut	2839-2844
Sivumäärä	6
ISBN (elektroninen)	978-1-6654-2159-1
DOI - pysyväislinkit	https://doi.org/10.1109/ISIT50566.2022.9834654
Tila	Julkaistu - 2022
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	IEEE International Symposium on Information Theory - Helsinki, Suomi Kesto: 26 kesäk. 2022 → 1 heinäk. 2022

Julkaisusarja

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

Conference

Conference	IEEE International Symposium on Information Theory
Lyhennettä	ISIT
Maa/Alue	Suomi
Kaupunki	Helsinki
Ajanjakso	26/06/2022 → 01/07/2022

Pääsy asiakirjaan

10.1109/ISIT50566.2022.9834654

https://arxiv.org/abs/2202.09095

OpenUrl-saatavuus

Koko teksti

Muut tiedostot ja linkit

Linkki julkaisuun Scopuksessa

Turvalliset hajautetut laskentaprotokollat ja sovelluksia digitaaliseen etäterveydenhuoltoon
Hollanti, C., Villamizar Rubiano, D., Kas Hanna, S., Makkonen, O., Yatsyna, P., Hieta-aho, E. & Sacikara Kariksiz, E.
01/01/2021 → 31/12/2023
Projekti: Academy of Finland: Other research funding

Siteeraa tätä

@inproceedings{f3e74a73ab324a6abc2eaa03d09dedff,

title = "Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes",

abstract = "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.",

author = "Perttu Saarela and Matteo Allaix and Ragnar Freij-Hollanti and Camilla Hollanti",

note = "Funding Information: ACKNOWLEDGMENTS This work was supported by the Academy of Finland, under Grants No. 318937 and 336005. Publisher Copyright: {\textcopyright} 2022 IEEE.; IEEE International Symposium on Information Theory, ISIT ; Conference date: 26-06-2022 Through 01-07-2022",

year = "2022",

doi = "10.1109/ISIT50566.2022.9834654",

language = "English",

series = "IEEE International Symposium on Information Theory",

publisher = "IEEE",

pages = "2839--2844",

booktitle = "2022 IEEE International Symposium on Information Theory, ISIT 2022",

address = "United States",

}

Saarela, P, Allaix, M , Freij-Hollanti, R & Hollanti, C 2022, Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. julkaisussa 2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE International Symposium on Information Theory, IEEE, Sivut 2839-2844, IEEE International Symposium on Information Theory, Helsinki, Suomi, 26/06/2022. https://doi.org/10.1109/ISIT50566.2022.9834654

Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. / Saarela, Perttu; Allaix, Matteo ; Freij-Hollanti, Ragnar et al.

2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE, 2022. s. 2839-2844 (IEEE International Symposium on Information Theory).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference contribution › Scientific › vertaisarvioitu

TY - GEN

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

AU - Saarela, Perttu

AU - Allaix, Matteo

AU - Freij-Hollanti, Ragnar

AU - Hollanti, Camilla

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85136277884&partnerID=8YFLogxK

U2 - 10.1109/ISIT50566.2022.9834654

DO - 10.1109/ISIT50566.2022.9834654

M3 - Conference contribution

AN - SCOPUS:85136277884

T3 - IEEE International Symposium on Information Theory

SP - 2839

EP - 2844

BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022

PB - IEEE

T2 - IEEE International Symposium on Information Theory

Y2 - 26 June 2022 through 1 July 2022

ER -

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

Abstrakti

Julkaisusarja

Conference

Pääsy asiakirjaan

OpenUrl-saatavuus

Muut tiedostot ja linkit

Sormenjälki

Projektit

Turvalliset hajautetut laskentaprotokollat ja sovelluksia digitaaliseen etäterveydenhuoltoon

Siteeraa tätä