Deterministic and Efficiently Searchable Encryption

  • Mihir Bellare
  • Alexandra Boldyreva
  • Adam O’Neill
Conference paper

DOI: 10.1007/978-3-540-74143-5_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4622)
Cite this paper as:
Bellare M., Boldyreva A., O’Neill A. (2007) Deterministic and Efficiently Searchable Encryption. In: Menezes A. (eds) Advances in Cryptology - CRYPTO 2007. CRYPTO 2007. Lecture Notes in Computer Science, vol 4622. Springer, Berlin, Heidelberg

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 (i.e. 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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Alexandra Boldyreva
    • 2
  • Adam O’Neill
    • 2
  1. 1.Dept. of Computer Science & Engineering, University of California at San Diego, 9500 Gilman Drive, La Jolla, CA 92093USA
  2. 2.College of Computing, Georgia Institute of Technology, 266 Ferst Drive, Atlanta, GA 30332USA

Personalised recommendations