Private information retrieval in distributed storage systems using an arbitrary linear code

@article{Kumar2017PrivateIR,
  title={Private information retrieval in distributed storage systems using an arbitrary linear code},
  author={Siddhartha Kumar and Eirik Rosnes and Alexandre Graell i Amat},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  year={2017},
  pages={1421-1425}
}
We propose an information-theoretic private information retrieval (PIR) scheme for distributed storage systems where data is stored using a linear systematic code of rate R> 1/2. The proposed scheme generalizes the PIR scheme for data stored using maximum distance separable codes recently proposed by Tajeddine and El Rouayheb for the scenario of a single spy node. We further propose an algorithm to optimize the communication price of privacy (cPoP) using the structure of the underlying linear… 
Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code
TLDR
This work provides a sufficient and a necessary condition for a code to be PIR capacity-achieving and proves that cyclic codes, Reed-Muller (RM) codes, and optimal information locality local reconstruction codes achieve both the finite Pir capacity and the asymptotic PIRcapacity with Protocols 1 and 2, respectively.
On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage
TLDR
It is proved that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the Pir capacity is known, and provides asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric P IR protocols.
A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code
TLDR
It is shown that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus PIR capacity-achieving.
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage
TLDR
It is proved that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the Pir capacity is known, and provides asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric P IR protocols.
Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
TLDR
The problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), is considered and a information theoretic PIR scheme is constructed with low download communication cost.
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes
TLDR
Three private information retrieval protocols for distributed storage systems (DSSs), where data is stored using an arbitrary linear code, are proposed and it is proved that cyclic codes, Reed–Muller codes, and a class of distance-optimal local reconstruction codes achieve both the finite and the asymptotic MDS-PIR capacity.
Private information retrieval from MDS coded data in distributed storage systems
TLDR
This work considers the problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), and constructs PIR schemes with low download communication cost, achieving the information theoretic limit for linear schemes.
$t$ -Private Information Retrieval Schemes Using Transitive Codes
TLDR
While many PIR schemes in the literature require field sizes that grow with the number of servers and files in the system, this work focuses especially on the case of a binary base field, for which Reed–Muller codes serve as an important and explicit class of examples.
Secure and Private Information Retrieval (SAPIR) in Cloud Storage Systems
TLDR
An information theoretic approach to security and privacy for cloud data storage systems based on random queries is proposed that ensures that a user privately downloads its desired content without the servers knowing the requested content index.
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 according to the suspected number of colluding
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Private information retrieval from MDS coded data in distributed storage systems
TLDR
This work considers the problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), and constructs PIR schemes with low download communication cost, achieving the information theoretic limit for linear schemes.
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 according to the suspected number of colluding
Private information retrieval for coded storage
TLDR
It is proved that the tradeoff between storage cost and retrieval/download cost depends on the number of data records in the system, and proposes a class of linear storage codes and retrieval schemes, and derives conditions under which these schemes are error-free and private.
One extra bit of download ensures perfectly private information retrieval
TLDR
This paper designs an explicit erasure code and PIR algorithm that requires only one extra bit of download to provide perfect privacy, and establishes the precise capacity of PIR with respect to the metric of download.
Codes for distributed PIR with low storage overhead
TLDR
It is proved that all known k-server PIR protocols can be efficiently emulated, while preserving both privacy and communication complexity but significantly reducing the storage overhead, and a new kind of binary linear codes are introduced, called here k- server PIR codes.
Barrier for Information-Theoretic Private Information Retrieval
Private Information Retrieval (PIR) protocols allow a user to retrieve a data item from a database while hiding the identity of the item being retrieved. Specifically, in information-theoretic,
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
TLDR
The complexity of information-theoretic k-server PIR is improved to n/sup O(log log k/k log k)/, and the PIR protocols are more efficient than previous ones for every k/spl ges/3, and the locally decodable codes are shorter for everyk/splges/4.
Batch codes and their applications
TLDR
This work demonstrates the usefulness of batch codes by presenting two types of applications: trading maximal load for storage in certain load-balancing scenarios, and amortizing the computational cost of private information retrieval (PIR) and related cryptographic protocols.
Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems
  • C. Huang, Minghua Chen, Jin Li
  • Computer Science
    Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)
  • 2007
To flexibly explore the trade-offs between storage space and access efficiency in reliable data storage systems, we describe two classes of erasure resilient coding schemes: basic and generalized
Private information retrieval
TLDR
This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
...
1
2
3
...