Private Information Retrieval by Keywords

By Benny Chor, Niv Gilboa, Moni Naor. 1998

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

PIR with Compressed Queries and Amortized Query Processing (2018, background): “As such,O could return the bucket id (as in the non-private setting) and the client could issue a PIR-by-keywords [27] query to this bucket.”
The Best of Both Worlds: Combining Information-Theoretic and Computational PIR for Communication Efficiency (2014, methodology): “Computational PIR was first introduced by Chor and Gilboa in 1997 [7].”
Keyword Search and Oblivious Pseudorandom Functions (2005, methodology): “[7] described how to implement semi-private KS using PIR and any data structure supporting keyword queries, and they added server privacy using a trie data structure and many rounds.”
Practical techniques for searches on encrypted data (2000, background): “, [16, 13, 10, 7] for important exceptions which allow to remove some—but not all—of those limitations).”
Batch codes and their applications (2004, methodology): “In particular, PIR has been used for various special-purpose secure computation tasks such as keyword search [10], distance approximations [13], statistical queries [7], and even for generally compiling a class of communication-efﬁcient protocols into secure ones [23].”
PRISM - Privacy-Preserving Search in MapReduce (2012, background): “Private Information Retrieval: Private Information Retrieval (and similarly oblivious transfer and oblivious RAM) has received a lot of attention [9, 15, 16, 22, 25, 32, 38, 39, 39, 42].”
Labeled PSI from Fully Homomorphic Encryption with Malicious Security (2018, methodology): “When the receiver’s set Y consists of a single element, this is equivalent to the (single-server variant of) Private Information Retrieval (PIR) by keywords problem, considered ﬁrst by [18].”
Secure Conjunctive Keyword Search over Encrypted Data (2004, background): “For example, private information retrieval (PIR) schemes (see, for example [6, 7, 5]) can potentially be used to solve this problem.”
Private Join and Compute from PIR with Default (2020, background): “Keyword PIR [CGN98] addressed the setting of sparse databases where the query index is over a keyword domain, and database is index with a subset of the same domain.”
RAID-PIR: Practical Multi-Server PIR (2014, unknown): “More elaborate schemes for object lookup in PIR based on key-words or identiﬁers were studied, e.g., [CGN98].”
Achieving Efficient Query Privacy for Location Based Services (2010, methodology): “We make the same assumptions as that of the underlying PIR scheme, where retrieval is either by object index or keyword [6].”
Function Secret Sharing: Improvements and Extensions (2016, background): “Realizing similar private search functionalities using standard PIR protocols requires the use of suitable data structures, which incur a significant additional overhead in round complexity, storage, and cost of updates [9].”
Revisiting the Computational Practicality of Private Information Retrieval (2011, methodology): “Note that this describes the basic “block-retrieval” PIR scheme; other work has extended PIR to allow more expressive queries, including by keywords [12] and by SQL [35].”
Private Information Retrieval With Side Information (2017, unknown): “, [4], [20], [21].”
A Survey on Private Information Retrieval (Column: Computational Complexity) (2004, background): “Theorem 6.6. [ 20 ] There exists an O((N + ‘)(lg N))-bit PERKY(‘, N, k) scheme.;”
Privacy-Preserving Queries over Relational Databases (2010, background): “Development of practical PIR schemes is crucial to maintaining user privacy in important application domains like patent databases, pharmaceutical databases, online censuses, real-time stock quotes, location-based services, and Internet domain registration.”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, background): “This protocol problem is otherwise known as symmetrically-private Keyword PIR [12] or “Keyword OT”, and it can be defined as a secure computation for the following functionality: Sender S contributes a set of (keyword,data) pairs {xi, yi}i=1.”
Secure Indexes (2003, methodology): “Chor et al. show how to use multiple rounds of PIR to search on keywords [10].”