Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

  • Universidad de Los Andes Colombia
  • Technical University of Munich

Abstract

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 files grows. Finally, the scheme is adapted to symmetric PIR.

Details

Original languageEnglish
Article number8598994
Pages (from-to)3898-3906
Number of pages9
JournalIEEE Transactions on Information Theory
Volume65
Issue number6
Early online date2019
Publication statusPublished - 1 Jun 2019
MoE publication typeA1 Journal article-refereed

    Research areas

  • Byzantine, information retrieval, Privacy, Reed-Solomon codes, reliability, robustness, servers

Download statistics

No data available

ID: 31155508