Skip to main content
Conference ProceedingsOPEN ACCESS

Conjunctive, subset, and range queries on encrypted data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4392 LNCS 535-554
DOI: 10.1007/978-3-540-70936-7_29
1.1kCitations
Citations of this article
222Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © International Association for Cryptologic Research 2007.

Cite

CITATION STYLE

APA

Boneh, D., & Waters, B. (2007). Conjunctive, subset, and range queries on encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4392 LNCS, pp. 535–554). Springer Verlag. https://doi.org/10.1007/978-3-540-70936-7_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free