TY - JOUR
T1 - Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
AU - Tajeddine, Razane
AU - Gnilke, Oliver W.
AU - Karpuk, David
AU - Freij-Hollanti, Ragnar
AU - Hollanti, Camilla
PY - 2019/6
Y1 - 2019/6
N2 - 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.
AB - 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.
KW - Byzantine
KW - information retrieval
KW - Privacy
KW - Reed-Solomon codes
KW - reliability
KW - robustness
KW - servers
UR - http://www.scopus.com/inward/record.url?scp=85065976996&partnerID=8YFLogxK
U2 - 10.1109/TIT.2018.2890285
DO - 10.1109/TIT.2018.2890285
M3 - Journal article
AN - SCOPUS:85065976996
SN - 0018-9448
VL - 65
SP - 3898
EP - 3906
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
M1 - 8598994
ER -