Abstract
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting. An explicit scheme using an [n, k] generalized Reed-Solomon storage code is designed, protecting against t-collusion and handling up to b byzantine and r non-responsive servers, when n\geq n^{\prime}=(\nu+1)k+t+2b+r-1, for some integer \nu\geq 1. This scheme achieves a PIR rate of 1-\frac{k+2b+t+r-1}{n^{\prime}-r}. In the case where the capacity is known, namely when k=1, it is asymptotically capacity achieving as the number of files grows.
| Original language | English |
|---|---|
| Title of host publication | 2018 IEEE International Symposium on Information Theory, ISIT 2018 |
| Publisher | IEEE |
| Pages | 2451-2455 |
| Number of pages | 5 |
| Volume | 2018-June |
| ISBN (Print) | 9781538647806 |
| DOIs | |
| Publication status | Published - 15 Aug 2018 |
| MoE publication type | A4 Article in a conference publication |
| Event | IEEE International Symposium on Information Theory - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018 |
Conference
| Conference | IEEE International Symposium on Information Theory |
|---|---|
| Abbreviated title | ISIT |
| Country/Territory | United States |
| City | Vail |
| Period | 17/06/2018 → 22/06/2018 |