Deterministic and Efficiently Searchable Encryption

By Mihir Bellare, Alexandra Boldyreva, Adam O'Neill. Annual International Cryptology Conference, 2007

858 citations recorded by the source corpus.

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

How researchers see this paper

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

1. Kui Ren
2. Ning Cao
3. Wenjing Lou
4. Dan Boneh
5. Shucheng Yu
6. Raluca Ada Popa
7. Ilya Mironov
8. Jin Li

Citations in the corpus

• 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].”
• BlindBox: Deep Packet Inspection over Encrypted Traffic (2015, background): “The second class of computation can support all DPI applications, including those which perform regular expressions or scripting.”
• DupLESS: Server-Aided Encryption for Deduplicated Storage (2013, background): “The definition is based on previous ones for deterministic encryption, a primitive subject to analogous inherent limitations [16] [17] [27].”
• Fuzzy Keyword Search over Encrypted Data in Cloud Computing (2010, methodology): “To securely search over encrypted data, searchable encryption techniques have been developed in recent years [2]–[10 ].”
• Achieving usable and privacy-assured similarity search over outsourced cloud data (2012, methodology): “To securely search the file collection for any interested typing input w, an authorized user uses the trapdoor generation key to generate a search request via some one-way function (similar as [7], [10], [14]), and submit it to the cloud.”
• Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions (2011, background): “Efficient (sub-linear time) search on encrypted data for the case of simple exact-match queries has been addressed by [2] in the symmetric-key setting and [6, 10, 7] in the public-key setting.”
• A Survey of Provably Secure Searchable Encryption (2014, unknown): “Deterministic encryption makes a scheme more efficient but at the same time leaks more information; that is, the ciphertext itself without any trapdoor leaks information (e.g., document/keyword similarity) and directly leaks the search pattern.”
• Data Security and Privacy Protection for Cloud Storage: A Survey (2020, background): “Therefore, how to enable users to search for specific keywords on encrypted files securely in the cloud has become the concern of many scholars [5], [46], [48], [52], [76].”
• Message-Locked Encryption and Secure Deduplication (2013, methodology): “D-PKE for such sources was achieved in [14].”
• Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data (2012, background): “We say X has high min-entropy if H 1 ðX Þ 2 !ðlog kÞ [17], where k is the bit length used to denote all the possible states of X .”
• Dynamic searchable symmetric encryption (2012, background): “(e) update the search table by setting Ts[λi[1]] := (φ, φ )⊕ λi[2] (f) update the dual of N1 by setting Ad[α ⋆ 1] := (”
• Generic Attacks on Secure Outsourced Databases (2016, background): “tion [45, 22, 13, 15, 14, 12, 40, 19, 33], functional encryption [9, 43], property-preserving encryption [5, 1, 7, 39] and homomorphic encryption [10, 21].”
• Order-Preserving Symmetric Encryption (2009, background): “(Such an approach was taken previously in the case of deterministic public-key encryption [5,10,6], on-line ciphers [4], and deterministic authenticated encryption [25].”
• Message-Locked Encryption for Lock-Dependent Messages (2013, methodology): “Bellare, M., Fischlin, M., O’Neill, A., Ristenpart, T.: Deterministic encryption: Definitional equivalences and constructions without random oracles.”
• Secure Ranked Keyword Search over Encrypted Cloud Data (2010, background): “Although hiding everything during the search from a malicious server (including access pattern), utilizing oblivious RAM usually brings the cost of logarithmic number of interactions between the user and the server for each search request.”