Projects per year
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.
|Title of host publication||2022 IEEE International Symposium on Information Theory, ISIT 2022|
|Number of pages||6|
|Publication status||Published - 2022|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE International Symposium on Information Theory - Helsinki, Finland|
Duration: 26 Jun 2022 → 1 Jul 2022
|Name||IEEE International Symposium on Information Theory|
|Conference||IEEE International Symposium on Information Theory|
|Period||26/06/2022 → 01/07/2022|
FingerprintDive into the research topics of 'Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes'. Together they form a unique fingerprint.
- 1 Active
Hollanti_ICT: Secure Distributed Computation Schemes with Applications to Digitalized Remote Healthcare
01/01/2021 → 31/12/2023
Project: Academy of Finland: Other research funding