Practical techniques for searches on encrypted data

By Dawn Song, David A. Wagner, Adrian Perrig. Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000, 2000

4,135 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/95216caad0c07d9fae76416676ffa9184a88b674

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. Dan Boneh
3. Kui Ren
4. Wenjing Lou
5. Amit Sahai
6. Jonathan Katz
7. Craig Gentry
8. Allison Bishop

In Computer Vision and Pattern Recognition

1. Brent Waters
2. Dan Boneh
3. Kui Ren
4. Wenjing Lou
5. Amit Sahai
6. Ning Cao
7. Xavier Boyen
8. Adam O'Neill

Citations in the corpus

• Achieving usable and privacy-assured similarity search over outsourced cloud data (2012, background): “[6]–[10], to list a few) is a helpful technique that treats encrypted data as files and allows a user to securely search over it through keywords and retrieve files of interest.”
• Multi-Dimensional Range Query over Encrypted Data (2007, background): “[44] and has had some r ecent improvements in security definitions and efficiency [21].”
• Balancing confidentiality and efficiency in untrusted relational DBMSs (2003, methodology): “Later, techniques have been developed aimed at efficiently querying encrypted databases [14], some of them related to parallel efforts by the text retrieval community [11] for executing hidden queries, that is, queries where only the ciphertext of the query arguments is made available to the DBMS.”
• Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data (2012, background): “Although traditional searchable encryption schemes (e.g., [8], [9], [10], [11], [12], to list a few) allow a user to securely search over encrypted data through keywords without first decrypting it, these techniques support only conventional Boolean keyword search, 1 without capturing any relevance…”
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013, background): “, [23,11,6,8,7,19]) gives practical constructions of SSE that support searching for documents that contain a single specified keyword.”
• Controlling data in the cloud: outsourcing computation without outsourcing control (2009, background): “For example, searchable encryption (also referred to as predicate encryption; see [43], [9], [42], [41], and [10]) allows the data owner to compute a capability from his secret key.”
• Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement (2016, methodology): “Based on [25], Goh [14], Chang and Mitzenmacher [27], and Curtmola et al.”
• Efficient verifiable fuzzy keyword search over encrypted data in cloud computing (2013, methodology): “Traditional searchable encryption schemes (SSE) [3], [5], [6], [7], [10], [11], [12], [19] have been proposed in recent years.”
• Data Security and Privacy Protection for Cloud Storage: A Survey (2020, methodology): “Specifically, in 2000, Song et al. [72] designed a practical searchable encryption technique, which implements key-word based query for whole document depending on XOR operation.”
• VABKS: Verifiable attribute-based keyword search over outsourced encrypted data (2014, background): “, [9]–[18]) and searchab le encryption in the public-key setting (e.”
• Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers (2012, background): “Various searchable encryption schemes, e.g., [6] [5] [10] [3] [1] [2] [8], have been proposed to fight against a computationally bounded adversary called honestbut-curious server, who (1) stores the outsourced data without tampering it; (2) honestly executes every search operation and returns…”
• A taxonomy of privacy-preserving record linkage techniques (2013, methodology): “Son00 : The approach of Song et al. [99] in 2000 in a two-party context with the HBC model takes into consideration the problem of approximate matching by calculating enciphered permutations of values using pseudo-random functions for private approximate searching of documents by certain query…”
• Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation (2012, background): “A similar type of model was briefly mentioned in [20].”
• A Review on the State-of-the-Art Privacy-Preserving Approaches in the e-Health Clouds (2014, methodology): “The first practical approach using searchable encryption based on symmetric key cryptography was introduced in [83], whereas the authors in [77] were the first to introduce the public key searchable encryption.”
• Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement (2016, background): “A popular way to search over encrypted data is searchable encryption [1] and many constructive schemes have been put forward under different applications.”
• Dynamic Searchable Encryption via Blind Storage (2014, methodology): “In building the SSE scheme, the search index entries for all the keywords are stored as individual files in the Blind Storage scheme (with care taken to facilitate updates).”