Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers.
IEEE Transactions on Information Theory(2019)
摘要
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)...
更多查看译文
关键词
Servers,Reed-Solomon codes,Indexes,Information retrieval,Measurement,Privacy,Adaptation models
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要