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). These systems also support arbitrary conjunctive queries (P 1 ∧· · ·∧P ) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.
Boneh and Waters constructed a hidden vector encryption (HVE) scheme that support conjunctive equality, conjunctive comparison, and subset queries on encrypted data REF .
Conjunctive, Subset, and Range Queries on Encrypted Data
the Theory of Cryptography Conference (TCC
Computer Science