Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

No Thumbnail Available
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
Date
2019-06-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
3898-3906
Series
IEEE Transactions on Information Theory, Volume 65, issue 6
Abstract
The problem of private information retrieval (PIR) from coded storage systems with colluding, Byzantine, and unresponsive servers is considered. An explicit scheme using an [n,k] Reed-Solomon storage code is designed, protecting against t-collusion, and handling up to b Byzantine and r unresponsive servers, when n>k+t+2b+r-1. This scheme achieves a PIR rate of ((n-r-(k+2b+t-1))/n-r). In the case where the capacity is known, namely, when k=1, it is asymptotically capacity achieving as the number of files grows. Finally, the scheme is adapted to symmetric PIR.
Description
Keywords
Byzantine, information retrieval, Privacy, Reed-Solomon codes, reliability, robustness, servers
Other note
Citation
Tajeddine, R, Gnilke, O, Karpuk, D, Freij-Hollanti, R & Hollanti, C 2019, ' Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers ', IEEE Transactions on Information Theory, vol. 65, no. 6, 8598994, pp. 3898-3906 . https://doi.org/10.1109/TIT.2018.2890285