Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
By Lucas Ballard, Seny Kamara, Fabian Monrose. International Conference on Information, Communications and Signal Processing, 2005
369 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/9611b29e6e4409842250f92d9defd2055a17b446
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 Computer Vision and Pattern Recognition
- Yong Ho Hwang
- Xingming Sun
- Marcel-Catalin Rosu
- Kui Ren
- Ning Cao
- Michael Steiner
- David Cash
- Wenjing Lou
Citations in the corpus
- A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, background): “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…”
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013, methodology): “To compute EP[i] one finds the least j such that s[j] = s[i] and then lets EP[i] = |{s[1], .”
- Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data (2012, background): “have also been proposed in [26], [27], [28].”
- Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “To overcome this shortcoming, the systems that provide conjunctive keyword search on encrypted data have been investigated [22,26,4,17].”
- A Survey of Provably Secure Searchable Encryption (2014, neutral): “2002; Boneh and Boyen 2004] Composite 3-Party DH (C3DH) [Boneh and Waters 2007] Computational DH (CDH)∗ [Diffie and Hellman 1976] Co-Diffie-Hellman (coDDH) [Boneh and Franklin 2003; Ballard et al. 2005b] External co-DH (coXDH) [Ryu and Takagi 2007] Decisional Composite Residuosity (DCR)∗ [Paillier 1”
- Achieving usable and privacy-assured similarity search over outsourced cloud data (2012, background): “As an attempt to enrich search predicates, conjunctive keyword search [19], [20], subset query [18] and range query over encrypted data [18], [21], have also been proposed in the public-key setting.”
- Privacy-preserving multi-keyword ranked search over encrypted cloud data (2011, neutral): “[15].”
- Searchable symmetric encryption: Improved definitions and efficient constructions (2006, neutral): “Initialization: a) scan D and build ∆ ′ , the set of distinct words in D .”
- 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.”
- Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data (2014, methodology): “To enrich search functionalities, conjunctive keyword search [16], [17], [18], [19], [20] over encrypted data have been proposed.”