Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers

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 design...

Full description

Saved in:
Bibliographic Details
Main Authors: Tajeddine, Razane, Gnilke, Oliver W., Karpuk, David, Freij-Hollanti, Ragnar, Hollanti, Camilla
Format: Conference Proceeding
Language:English
Subjects:
Generators
Information retrieval
Reed-Solomon codes
Robustness
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ≥ n 1' =(ν+1)k+t+2b+r-1, for some integer ν ≥ 1. This scheme achieves a PIR rate of 1-[(k+2b+t+r-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.
ISSN:2157-8117
DOI:10.1109/ISIT.2018.8437670