• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Conjunctive, subset, and range queries on encrypted data (2007)

Cached

  • Download as a PDF

Download Links

  • [www.iacr.org]
  • [eprint.iacr.org]
  • [crypto.stanford.edu]
  • [crypto.stanford.edu]
  • [www.stanford.edu]
  • [crypto.stanford.edu]
  • [theory.stanford.edu]
  • [eprint.iacr.org]
  • [www.cs.ucdavis.edu]
  • [crypto.stanford.edu]
  • [crypto.stanford.edu]
  • [www.cs.ucdavis.edu]
  • [www.utdallas.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Dan Boneh , Brent Waters
Citations:183 - 20 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Boneh07conjunctive,subset,,
    author = {Dan Boneh and Brent Waters},
    title = {Conjunctive, subset, and range queries on encrypted data },
    year = {2007}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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.

Keyphrases

cryptology eprint archive    range query    public-key system    individual conjuncts    general framework    subset query    comparison query    arbitrary conjunctive query    general query   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University