Keyword search and oblivious pseudorandom functions

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

doi:10.1007/978-3-540-30576-7_17

Keyword search and oblivious pseudorandom functions

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

Research output: Contribution to journal › Conference article › peer-review

283 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 language	English (US)
Pages (from-to)	303-324
Number of pages	22
Journal	LECTURE NOTES IN COMPUTER SCIENCE
Volume	3378
DOIs	https://doi.org/10.1007/978-3-540-30576-7_17
State	Published - 2005
Externally published	Yes
Event	Second Theory of Cryptography Conference, TCC 2005 - Cambridge, MA, United States Duration: Feb 10 2005 → Feb 12 2005

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Keywords

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

Access to Document

10.1007/978-3-540-30576-7_17

Cite this

@article{6f65cd97affc489a81cd7c9b9cdf72e5,

title = "Keyword search and oblivious pseudorandom functions",

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.",

keywords = "Oblivious pseudorandom functions, Privacy-preserving protocols, Private information retrieval, Secure keyword search, Secure two-party protocols",

author = "Freedman, {Michael J.} and Yuval Ishai and Benny Pinkas and Omer Reingold",

year = "2005",

doi = "10.1007/978-3-540-30576-7_17",

language = "English (US)",

volume = "3378",

pages = "303--324",

journal = "LECTURE NOTES IN COMPUTER SCIENCE",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "Second Theory of Cryptography Conference, TCC 2005 ; Conference date: 10-02-2005 Through 12-02-2005",

}

TY - JOUR

T1 - Keyword search and oblivious pseudorandom functions

AU - Freedman, Michael J.

AU - Ishai, Yuval

AU - Pinkas, Benny

AU - Reingold, Omer

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Oblivious pseudorandom functions

KW - Privacy-preserving protocols

KW - Private information retrieval

KW - Secure keyword search

KW - Secure two-party protocols

UR - http://www.scopus.com/inward/record.url?scp=24144488603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24144488603&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-30576-7_17

DO - 10.1007/978-3-540-30576-7_17

M3 - Conference article

AN - SCOPUS:24144488603

SN - 0302-9743

VL - 3378

SP - 303

EP - 324

JO - LECTURE NOTES IN COMPUTER SCIENCE

JF - LECTURE NOTES IN COMPUTER SCIENCE

T2 - Second Theory of Cryptography Conference, TCC 2005

Y2 - 10 February 2005 through 12 February 2005

ER -

Keyword search and oblivious pseudorandom functions

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this