Information-Theoretic Private Information Retrieval: A Unified Construction

143 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers (2018, background): “Related work: Initially, PIR constructions served to reduce the total download cost from a storage system with data replicated on multiple servers [2]–[7].”
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval (2002, background): “This upper bound remained the best known until this work, in spite of various attempts to improve it [20, 21, 5].”
Robust Information-Theoretic Private Information Retrieval (2002, methodology): “Specifically, the best communication complexity of such protocol is O(n1=b(2k 1)=t ) [7].”
A geometric approach to information-theoretic private information retrieval (2005, methodology): “To illustrate the power of our approach, we also give alternative, geometric proofs of some of the best1-private upper bounds from [7].”
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing (2000, methodology): “We rely on the PIR protocol of [6], whose properties are summarized by Lemma 4.”
Privacy-Preserving Inter-database Operations (2004, background): “that is secure despite t of the k servers colluding [4].”
Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing (2004, methodology): “We rely on the PIR protocol of [6], whose properties are summarized by Lemma 4.”