Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
نویسندگان
چکیده
منابع مشابه
Achievable Rate of Private Function Retrieval from MDS Coded Databases
We study the problem of private function retrieval (PFR) in a distributed storage system. In PFR the user wishes to retrieve a linear combination of M messages stored in noncolluding (N,K) MDS coded databases while revealing no information about the coefficients of the intended linear combination to any of the individual databases. We present an achievable scheme for MDS coded PFR with a rate t...
متن کامل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...
متن کاملPrivate Information Retrieval from Storage Constrained Databases - Coded Caching meets PIR
Private information retrieval (PIR) allows a user to retrieve a desired message out of K possible messages from N databases without revealing the identity of the desired message. There has been significant recent progress on understanding fundamental information theoretic limits of PIR, and in particular the download cost of PIR for several variations. Majority of existing works however, assume...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2815607