Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers
نویسندگان
چکیده
منابع مشابه
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 nonresponsive 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, wh...
متن کاملPrivate Information Retrieval from Coded Databases with Colluding Servers
We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme to the suspected number of colluding servers. If the storage code is a generalized Reed-Solomon code of length n and dimension k, we design PIR schemes that achieve a PIR rate of n−(k+t−1) n while protecting against any t colluding servers, for ...
متن کاملPrivate Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models
Private information retrieval (PIR) gets renewed attentions due to its information-theoretic reformulation and its application in distributed storage system (DSS). The general PIR model considers a coded database containing N servers storing M files. Each file is stored independently via the same arbitrary (N,K)-MDS code. A user wants to retrieve a specific file from the database privately agai...
متن کاملA general private information retrieval scheme for MDS coded databases with colluding servers
The problem of private information retrieval gets renewed attentions in recent years due to its information-theoretic reformulation and applications in distributed storage systems. PIR capacity is the maximal number of bits privately retrieved per one bit of downloaded bit. The capacity has been fully solved for some degenerating cases. For a general case where the database is both coded and co...
متن کاملThe Capacity of Private Information Retrieval from Byzantine and Colluding Databases
We consider the problem of single-round private information retrieval (PIR) from N replicated databases. We consider the case when B databases are outdated (unsynchronized), or even worse, adversarial (Byzantine), and therefore, can return incorrect answers. In the PIR problem with Byzantine databases (BPIR), a user wishes to retrieve a specific message from a set of M messages with zero-error,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2890285