Date Added: Jan 2011
The authors study the problem of privacy-preserving access to a database. Particularly, they consider the problem of privacy-preserving Keyword Search (KS), where records in the database are accessed according to their associated keywords and where they care for the privacy of both the client and the server. They provide efficient solutions for various settings of KS, based either on specific assumptions or on general primitives (mainly oblivious transfer). The general solutions rely on a new connection between KS and the Oblivious evaluation of Pseudo Random Functions (OPRFs).