Conjunctive, Subset, and Range Queries on Encrypted Data

By Dan Boneh, Brent Waters. Theory of Cryptography Conference, 2007

1,575 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/f1e1d45de45ef4684b5b16fa6a6b4c4b1fa9cfaa

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures (2008, methodology): “For the recipient to know whether the decryption was successful without knowing the ciphertext policy W , we can use the technique used in [5] in practice.”
Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, background): “problem [96] (DDH), Bilinear Diffie-Hellman problem [95], [97] (BDH), and so on.”
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014, background): “Predicate encryption [BW07, KSW08] provides a stronger privacy guarantee than ABE by additionally hiding the attribute vector x .”
Privacy-preserving multi-keyword ranked search over encrypted cloud data (2011, background): “[16], or communication cost by secret sharing, e.”
Searchable symmetric encryption: Improved definitions and efficient constructions (2006, background): “This includes conjunctive queries in the symmetric key setting [26, 6]; it also includes conjunctive queries [37, 17], comparison and subset queries [17], and range queries [39] in the public-key setting.”
Efficient verifiable fuzzy keyword search over encrypted data in cloud computing (2013, background): “Traditional searchable encryption schemes (SSE) [3], [5], [6], [7], [10], [11], [12], [19] have been proposed in recent years.”
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, background): “Recently, Boneh and Waters introduced public-key systems with conjunctive, subset, and range queries on encrypted data [16].”
Decentralizing Attribute-Based Encryption (2011, methodology): “We note that several systems such as BGN encryption [15], GrothOstrovsky-Sahai NIZK proofs [32], traitor tracing [16] , and predicate encryption [17, 36] were originally developed in the composite order setting, but later variants were developed in prime order groups [31, 48, 33, 35, 25, 26, 37].”
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (2009, methodology): “We believe that our Dual System methodology in the future will become a catalyst for proving adaptive security under simple assumptions for several other encryption systems including: Anonymous IBE and searchable encryption [4, 1, 10, 9, 24], Broadcast Encryption [14, 7], and Attribute-Based Encrypt”
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008, background): “Boneh and Waters [10] construct a predicate encryption scheme that handles conjunctions (of, e.”
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (2010, background): “Subsequent authors have built on their work to create protocols such as non-interactive zero-knowledge proofs [19, 20], ring and group signatures [10, 31], attribute-based encryption [8, 23], traitor tracing schemes [7], and hierarchical identity-based encryption [24, 33].”
Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, background): “Later, several multi-keyword search schemes were proposed [19], [5], [11], [33], [21], [32], [22], [34], [13] that enable conjunctive or disjunctive search formulas.”
An Ideal-Security Protocol for Order-Preserving Encoding (2013, background): “…and Shikfa [22] discuss the leakage associated with revealing order in practice, and techniques for minimizing such leakage, which is applicable to mOPE as well as other OPE schemes. mOPE is also related to cryptographic schemes for performing range queries over encrypted data [8, 19, 28, 36].”
A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, methodology): “So far, abundant works have been proposed under different threat models to achieve various search functionality, such as single keyword search, similarity search, multi-keyword boolean search, ranked search, multi-keyword ranked search, etc. Page 142 IEEE document frequency (IDF)” model are…”
Order-Preserving Symmetric Encryption (2009, background): “Allowing range queries on encrypted data in the public-key setting was studied in [11,26].”