A Survey on Private Information Retrieval

By William I. Gasarch. 2004

How researchers see this paper

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

Citations in the corpus

Lifting Private Information Retrieval from Two to any Number of Messages (2018, background): “The PIR problem was ﬁrst introduced and studied in [1], [2] and was followed up by a large body of work (e.g. [3]–[8]).”
XPIR : Private Information Retrieval for Everyone (2016, background): “Generic transformations exist from PIR to SPIR but this is beyond the scope of this paper (see [3]).”
The Capacity of Private Information Retrieval From Coded Databases (2016, methodology): “= [ hT n w [1] 1 · · · hT n w[1] L̃ h T n w [2] 1 · · · hT n w[2] L̃ · · ·”
The Capacity of Private Information Retrieval (2016, background): “1There is another line of research, where privacy needs to be satisfied only for computationally bounded databases [9], [8], [23].”
Riposte: An Anonymous Messaging System Handling Millions of Users (2015, background): “Our DPF constructions make extensive use of prior work on private information retrieval (PIR) [16], [17], [33], [37].”
On the Computational Practicality of Private Information Retrieval (2006, background): “We invite the reader to explore a multitude of existing sources, including the excellent, almost complete survey by William Gasarch [31] [32].”
Scalable and Private Media Consumption with Popcorn (2016, background): “These protocols [31, 47, 69, 84, 109] allow clients (content consumers) to request content from servers (content distributors) without the servers being able to infer which items the clients requested.”
Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach (2011, background): “information private from an adversary who is not a legitimate participant and hence does not need to be given any access to the private information [8]–[13]. The private information retrieval problem [14] is one of conﬁdential searching, i.e. the issue is the privacy of the querier of a database tha”
An information-theoretic approach to privacy (2010, background): “In the private information retrievalmodel [20], the privacy problem is inverted in that the adversary is the database from whom the user wants to keep hisquery secret.”
The Capacity of Private Information Retrieval from Byzantine and Colluding Databases (2017, methodology): “This results in the sums x [1] L2 + σ [2] K1 = a[7:12] + b[7:12], and the sums x [1] L3 + σ [3] K1 = a[13:18] + c[7:12].”
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage (2008, background): “The (un-trusted) server need not be aware of the protocol, but rather just provide traditional store/retrieve primitives.”
On the Utility of Privacy-Preserving Histograms (2004, background): “…aggregation and perturbation of contingency tables [16] [22], input perturbation (see, for example, [32] [33] [28] in the statistics literature and [3] [2] [17] from the data mining literature), imputation [29], k-anonymity [30], and cryptographic approaches to privacy (see, e.g., [20] and [21]).”
Private information retrieval with side information: The single server case (2017, unknown): “, [5]–[10]).”
Private Information Retrieval With Side Information (2017, background): “This replication-based model has been the one that is predominantly studied in the PIR literature, with breakthrough results in the past few years (e.g., [5]–[10]).”
Robust private information retrieval on coded data (2017, background): “The literature on PIR has focused on efficient schemes that can achieve privacy while minimizing different system costs, and in particular, the communication cost, which has received the most attention [3].”
The Capacity of Robust Private Information Retrieval With Colluding Databases (2016, background): “1There is another line of research, where privacy needs to be satisfied only for computationally bounded databases [16]–[18].”