Cryptology ePrint Archive: Report 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 \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.

Category / Keywords: public-key cryptography / search

Date: received 22 Aug 2006, last revised 21 Mar 2007

Contact author: bwaters at csl sri com

Available format(s): PDF | BibTeX Citation

Version: 20070321:171919 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]