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

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

2 Citations (Scopus)

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.

Original language	English
Title of host publication	2022 IEEE International Symposium on Information Theory, ISIT 2022
Publisher	IEEE
Pages	2839-2844
Number of pages	6
ISBN (Electronic)	978-1-6654-2159-1
DOIs	https://doi.org/10.1109/ISIT50566.2022.9834654
Publication status	Published - 2022
MoE publication type	A4 Conference publication
Event	IEEE International Symposium on Information Theory - Espoo, Finland Duration: 26 Jun 2022 → 1 Jul 2022

Publication series

Name	IEEE International Symposium on Information Theory
ISSN (Electronic)	2157-8117

Conference

Conference	IEEE International Symposium on Information Theory
Abbreviated title	ISIT
Country/Territory	Finland
City	Espoo
Period	26/06/2022 → 01/07/2022

Access to Document

10.1109/ISIT50566.2022.9834654

https://arxiv.org/abs/2202.09095

Cite this

@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. in 2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE International Symposium on Information Theory, IEEE, pp. 2839-2844, IEEE International Symposium on Information Theory, Espoo, Finland, 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. p. 2839-2844 (IEEE International Symposium on Information Theory).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

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 article in proceedings

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Hollanti_ICT: Secure Distributed Computation Schemes with Applications to Digitalized Remote Healthcare

Cite this

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Projects

Hollanti_ICT: Secure Distributed Computation Schemes with Applications to Digitalized Remote Healthcare

Cite this