Secure Conjunctive Keyword Search over Encrypted Data

By Philippe Golle, Jessica Staddon, Brent Waters. International Conference on Applied Cryptography and Network Security, 2004

907 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/61f18940b1f43a0a442cbe75e1b2cd2b6eb3aefe

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

1. Kui Ren
2. Wenjing Lou
3. Brent Waters
4. Ning Cao
5. Xingming Sun
6. Ming Li
7. Dan Boneh
8. Xinhui Wang

In Computer Vision and Pattern Recognition

1. Seny Kamara
2. Kui Ren
3. Wenjing Lou
4. Yong Ho Hwang
5. Pil Joong Lee
6. Brent Waters
7. Dan Boneh
8. Ning Cao

Citations in the corpus

• Cryptographic Cloud Storage (2010, background): “The only SSE scheme we are aware of that handles conjunctions [24] is based on pairings on elliptic curves and is as inefficient as the asymmetric searchable encryption schemes discussed below.”
• Parallel and Dynamic Searchable Symmetric Encryption (2013, background): “This includes conjunctive queries in the symmetric key setting [10]; it also includes conjunctive queries [16,2], comparison and subset queries [2], and range queries [17] in the public-key setting.”
• Dynamic Searchable Encryption via Blind Storage (2014, neutral): “Firstly, this limits the choice of service providers available to a user: one could use Amazon EC2 for computation, combined with Amazon S3 for storage; however, it is not viable to use Dropbox for persistent storage and Amazon EC2 for computation, as this would incur high costs for communication…”
• 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.”
• Off-Line Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data (2006, background): “Over the years, keyword search schemes based on public key encryption have been studied in viewpoint of how to efficiently design single or conjunctive protocols with provable security [7, 8 ,9,11,12,13,14].”
• Public Key Encryption with Conjunctive Field Keyword Search (2004, methodology): “1 A similar security game ICLR (indistinguishability of ciphertext from limited ran- dom) is defined in [ 7 ].”
• Searchable symmetric encryption: Improved definitions and efficient constructions (2006, neutral): “And though much work on searchable encryption uses IND2-CKA as a security definition [21, 29, 5], we note that it was never intended as such.”
• Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud (2014, methodology): “works which supported the conjunctive keyword search, subset search, range queries were using the asymetric encryption [5]–[7].”
• Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005, background): “Song, Wagner, and Perrig [18] and Waters et al. [20] do not formally state and prove consistency conditions for their respective searchable encryption schemes, but they, as well as Goh [12], do acknowledge and informally bound the non-zero probability of a false positive.”
• A Survey of Provably Secure Searchable Encryption (2014, neutral): “Recently, Kamara et al. [2012] proposed a framework for describing and comparing the leakage of SE schemes.”
• 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…”
• Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, background): “To support more complex queries, conjunctive keyword search schemes [19], [5] over encrypted data have been proposed.”
• Secure Ranked Keyword Search over Encrypted Cloud Data (2010, methodology): “As an attempt to enrich query predicates, conjunctive keyword search over encrypted data have also been proposed in [19]–[21].”
• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “Golle, Staddon, and Waters first defined the security games of symmetric encryptions for conjunctive keyword search [22].”
• Verifiable Privacy-Preserving Multi-Keyword Text Search in the Cloud Supporting Similarity-Based Ranking (2013, background): “range queries [13], [14], [15], but they are too computationally intensive to be implemented for practical use.”
• 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.”
• Scalable and efficient provable data possession (2008, background): “Later research focused on outsourcing encrypted data (placing even less trust in the server) and associated difficult problems mainly having to do with efficient querying over encrypted domain [20, 32, 9, 18].”
• An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks (2017, background): “Roughly speaking, these works can be classified into the following types: 1) multi-users access control in PEKS [37, 31, 38], 2) fuzzy keyword search in PEKS [10, 12, 27], 3) flexible keyword search in PEKS [29, 18, 24], and 4) trapdoor privacy in PEKS [42, 23, 1, 28, 35].”