Conjunctive, Subset, and Range Queries on Encrypted Data

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 g...

Full description

Saved in:
Bibliographic Details
Published inTheory of Cryptography Vol. 4392; pp. 535 - 554
Main Authors Boneh, Dan, Waters, Brent
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2007
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Encrypt Data
Equality Query
Mail Server
Message Space
Range Query
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783540709350
3540709355
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-70936-7_29