Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers
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 …