Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TCC
2007
Springer

favoriteEmaildiscussreport

146views Cryptology» more TCC 2007»

Conjunctive, Subset, and Range Queries on Encrypted Data

13 years 10 months ago

Conjunctive, Subset, and Range Queries on Encrypted Data

Download crypto.stanford.edu

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 support arbitrary conjunctive queries (P1 ∧· · ·∧P ) without leaking information on individual conjuncts. In addition, we present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.

Dan Boneh, Brent Waters

Real-time Traffic

Arbitrary Conjunctive Queries | Comparison Queries | Cryptography | Public-key Systems | TCC 2007 |

claim paper

Related Content

» Secure Conjunctive Keyword Search over Encrypted Data

» MultiDimensional Range Query over Encrypted Data

» Aggregation Queries in the DatabaseAsaService Model

» Data Complexity of Answering Unions of Conjunctive Queries in SHIQ

» Searching Keywords with Wildcards on Encrypted Data

» Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description L...

» Shared and Searchable Encrypted Data for Untrusted Servers

» Intensional Encapsulations of Database Subsets via Genetic Programming

» Data Structures for RangeAggregate Extent Queries

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	TCC
Authors	Dan Boneh, Brent Waters

Comments (0)