A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
[article]
2018
arXiv
pre-print
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
arXiv:1806.08006v3
fatcat:7ppunmvm4zhlvep4jknk43ogby