Keyword search and oblivious pseudorandom functions

Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold

Research output: Contribution to journalConference article

149 Scopus citations

Abstract

We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are accessed according to their associated keywords and where we care for the privacy of both the client and the server. We provide efficient solutions for various settings of KS, based either on specific assumptions or on general primitives (mainly oblivious transfer). Our general solutions rely on a new connection between KS and the oblivious evaluation of pseudorandom functions (OPRFs). We therefore study both the definition and construction of OPRFs and, as a corollary, give improved constructions of OPRFs that may be of independent interest.

Original languageEnglish (US)
Pages (from-to)303-324
Number of pages22
JournalLECTURE NOTES IN COMPUTER SCIENCE
Volume3378
DOIs
StatePublished - 2005
Externally publishedYes
EventSecond Theory of Cryptography Conference, TCC 2005 - Cambridge, MA, United States
Duration: Feb 10 2005Feb 12 2005

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Keywords

  • Oblivious pseudorandom functions
  • Privacy-preserving protocols
  • Private information retrieval
  • Secure keyword search
  • Secure two-party protocols

Fingerprint Dive into the research topics of 'Keyword search and oblivious pseudorandom functions'. Together they form a unique fingerprint.

Cite this