International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Conjunctive, Subset, and Range Queries on Encrypted Data

Authors:
Dan Boneh
Brent Waters
Download:
URL: http://eprint.iacr.org/2006/287
Search ePrint
Search Google
Abstract: We construct public-key systems that support comparison queries ($x \geq a)$ on encrypted data as well as more general queries such as subset queries $(x \in S)$. These systems also support arbitrary conjunctive queries ($P_1 \wedge \cdots \wedge P_\ell$) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.
BibTeX
@misc{eprint-2006-21779,
  title={Conjunctive, Subset, and Range Queries on Encrypted Data},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / search},
  url={http://eprint.iacr.org/2006/287},
  note={ bwaters@csl.sri.com 13593 received 22 Aug 2006, last revised 21 Mar 2007},
  author={Dan Boneh and Brent Waters},
  year=2006
}