The Capacity of Multi-round Private Information Retrieval from Byzantine Databases

Xinyu Yao; Nan Liu; Wei Kang

The Capacity of Multi-round Private Information Retrieval from Byzantine Databases

Information Theory 2019-01-23 v1 math.IT

Authors: Xinyu Yao , Nan Liu , Wei Kang

Abstract

In this work, we investigate the capacity of private information retrieval (PIR) from $N$ replicated databases, where a subset of the databases are untrustworthy (byzantine) in their answers to the query of the user. We allow for multi-round queries and demonstrate that the identities of the byzantine databases can be determined with a small additional download cost. As a result, the capacity of the multi-round PIR with byzantine databases (BPIR) reaches that of the robust PIR problem when the number of byzantine databases is less than the number of trustworthy databases.

Keywords

private information retrieval

Cite

@article{arxiv.1901.06907,
  title  = {The Capacity of Multi-round Private Information Retrieval from Byzantine Databases},
  author = {Xinyu Yao and Nan Liu and Wei Kang},
  journal= {arXiv preprint arXiv:1901.06907},
  year   = {2019}
}

Comments

8 pages, 2 figures

Related papers

View all related →