Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

By Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Charles Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi. Journal of Cryptology, 2005

999 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/108e7fe285c3811e361f24d2a9654ce7a3fb590e

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. Brent Waters
2. Kui Ren
3. Wenjing Lou
4. Dan Boneh
5. Amit Sahai
6. Allison Bishop
7. Ning Cao
8. Ming Li

In Computational Theory and Mathematics

1. Brent Waters
2. Allison Bishop
3. Amit Sahai
4. Dan Boneh
5. Kui Ren
6. Wenjing Lou
7. Craig Gentry
8. Xavier Boyen

Citations in the corpus

• Conjunctive, Subset, and Range Queries on Encrypted Data (2007, methodology): “2 where we showed equivalence to anonymous IBE [9, 1, 13].”
• Public Key Encryption That Allows PIR Queries (2007, background): “The only previous results for such a scenario in the public-key setting, is due to Boneh et al. [6] and Abddalla et al. [1] who deal with the same storage-provider setting we describe above; however, their solution reveals partial information; namely, the particular keyword that Alice is searching f”
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, background): “[1], in their CRYPTO’05 paper, to ask for the creation of an Anonymous HIBE system, preferably without random oracles, as an important open research problem.”
• Practical Identity-Based Encryption Without Random Oracles (2006, background): “[1] propose the open problem of finding an anonymous IBE system secure without random oracles.”
• Outsourcing the Decryption of ABE Ciphertexts (2011, background): “1A more general concept of functional encryption [11] allows for more general functions to be computed on the encrypted data and encompasses work such as searching on encrypted data and predicate encryption [10, 2, 12, 39, 27].”
• Decentralizing Attribute-Based Encryption (2011, background): “Another interesting direction is the construction of “anonymous” or predicate encryption systems [36, 49, 17, 12, 1, 47, 37] where in addition to the data the encryption policy or other properties are hidden.”
• Searchable symmetric encryption: Improved definitions and efficient constructions (2006, neutral): “The server computation row shows the costs per returned document for a query.”
• Multi-Dimensional Range Query over Encrypted Data (2007, methodology): “Nevertheless, on a technical level, this AHIBE scheme and its extension to M-AHIBE are the most closely related work to ours.”
• Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data (2014, background): “Traditional single keyword searchable encryption schemes [7], [8], [9], [10], [11], [12], [13], [14], [15], [25], [26] usually build an encrypted searchable index such that its content is hidden to the server unless it is given appropriate trapdoors generated via secret key(s) [4].”
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013, background): “To compute s[i] one finds the least j such that s[j] = s[i] and then lets s[i] = |{s[1], .”
• Deterministic and Efficiently Searchable Encryption (2007, background): “Indeed, Am(1 k) could output (x, t) where x[1] is chosen at random from {0, 1}k , |x| = 1, and t = E(pk,x).”
• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, background): “Moreover, several works were introduced to improve the efficiency of the system and provide stronger security [18,31,19,1].”
• 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”
• A Survey of Provably Secure Searchable Encryption (2014, neutral): “Since there is a wide spectrum of different techniques for PKE, searchable encryption in the M/S architecture can be realized using different primitives (e.g., IBE [Boneh and Boyen 2004], AIBE and HIBE [Abdalla et al. 2008], and HVE [Boneh and Waters 2007]).”