Conjunctive, Subset, and Range Queries on Encrypted Data

Dan Boneh; Brent Waters

Paper 2006/287

Conjunctive, Subset, and Range Queries on Encrypted Data

Dan Boneh and Brent Waters

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} \land \dots \land P_{ℓ}$ ) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: search
Contact author(s): bwaters @ csl sri com
History: 2007-03-21: last of 4 revisions; 2006-08-24: received; See all versions
Short URL: https://ia.cr/2006/287
License: CC BY

BibTeX

@misc{cryptoeprint:2006/287,
      author = {Dan Boneh and Brent Waters},
      title = {Conjunctive, Subset, and Range Queries on Encrypted Data},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/287},
      year = {2006},
      url = {https://eprint.iacr.org/2006/287}
}