Cryptology & Information Security Group CWI


  RISC Seminar

Deterministic and Efficiently Searchable Encryption

Speaker: Adam O'Neill (Georgia Tech)
Date/Time:Thu 28.06.07, 14.00 - 14.30 h
Location: Room H220 in the NIKHEF building (just next to the CWI building), CWI Amsterdam
Abstract: We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We obtain as a consequence database encryption methods that permit fast (ie. sub-linear, and in fact logarithmic, time) search while provably providing privacy that is as strong as possible subject to this fast search constraint. One of our constructs, called RSA-DOAEP, has the added feature of being length preserving, so that it is the first example of a public-key cipher. We generalize this to obtain a notion of efficiently-searchable encryption schemes which permit more flexible privacy to search-time trade-offs via a technique called bucketization. Our results answer much-asked questions in the database community and provide foundations for work done there.
Joint work with Mihir Bellare (UCSD) and Alexandra Boldyreva (Georgia Tech)


Mission Statement

RISC Seminar



Last modified: Wed Apr 18 17:53:40 MEST 2007