Conjunctive, Subset, and Range Queries on Encrypted Data

  • Dan Boneh
  • Brent Waters
Conference paper

DOI: 10.1007/978-3-540-70936-7_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4392)
Cite this paper as:
Boneh D., Waters B. (2007) Conjunctive, Subset, and Range Queries on Encrypted Data. In: Vadhan S.P. (eds) Theory of Cryptography. TCC 2007. Lecture Notes in Computer Science, vol 4392. Springer, Berlin, Heidelberg


We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x ∈ S). Furthermore, these systems support arbitrary conjunctive queries (P1 ∧ ⋯ ∧ P) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.

Download to read the full conference paper text

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Dan Boneh
    • 1
  • Brent Waters
    • 2
  1. 1.Stanford University 
  2. 2.SRI International 

Personalised recommendations