link

December 28, Tuesday
12:00 – 14:00

Keyword Search and Oblivious Pseudorandom Functions
Computer Science seminar
Lecturer : Dr. Benny Pinkas
Lecturer homepage : http://www.pinkas.net/
Affiliation : HP Labs, Israel
Location : -101/58
Host : Dr. Kobbi Nissim
We study the problem of privacy preserving access to a database and in particular the problem of keyword search. In this problem records in a database are associated with keywords, and a client wishes to retrieve all records that are associated with a specific keyword. The retrieval process must hide the client's keyword from the database owner, and hide the contents of the database from the client, except for the records that are associated with the keyword.

We study various settings of this problem and give solutions based either on specific assumptions or on general primitives (mainly oblivious transfer).

Joint work with Michael Freedman, Yuval Ishai, and Omer Reingold.

Bio: Benny Pinkas received his PhD from the Weizmann Institute in 2000. Following that he worked in the research lab of Intertrust technologies, and in HP Labs (in Princeton and in Haifa). He will join Haifa University in 2005.