Building an Encrypted and Searchable Audit Log

By Brent Waters, Dirk Balfanz, Glenn Durfee, Diana K. Smetters. Network and Distributed System Security Symposium, 2004

424 citations recorded by the source corpus.

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

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. Brent Waters
4. Dan Boneh
5. Yong Ho Hwang
6. Matthew D. Green
7. Jiale Zhang
8. Allison Bishop

Citations in the corpus

• Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data (2012, background): “Traditional searchable encryption [8], [9], [10], [11], [12], [24], [25] has been widely studied as a cryptographic primitive, with a focus on security definition formalizations and efficiency improvements.”
• Public Key Encryption with Keyword Search Revisited (2008, methodology): “Shortly after Boneh et al.’s work [6], Waters et al. [12] showed that the PEKS scheme based on the bilinear pairing can be applied to build encrypted and searchable audit logs.”
• Vanish: Increasing Data Privacy with Self-Destructing Data (2009, background): “Self-destructing data is broadly applicable in today’s Web-oriented world, in which users often leave permanent traces on many Web sites [61].”
• Secure Indexes (2003, methodology): “Waters et al. [23] build private audit logs that allow keyword searches only if the querier possesses trapdoors for those keywords.”
• Conjunctive, Subset, and Range Queries on Encrypted Data (2007, methodology): “Related work. Equality tests on encrypted data were considered in [19, 9]. Equality searches on an encrypted audit log were proposed in [ 20 ].”
• Identity-Based Proxy Re-encryption (2007, background): “First introduced by Shamir in 1984 and then realized by Boneh-Franklin [7] and by Cocks [11] several years later, identity-based encryption has proven useful in solving several key-distribution issues, and has permitted the development of a variety of novel cryptographic protocols, e.g., secret hand”
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, methodology): “As a simple example of real-world application of our scheme, PEKS is a useful primitive for building secure audit logs [32,18].”
• Privacy and Data Protection by Design - from policy to engineering (2014, background): “Solutions have been proposed to define the information to be recorded in the logs [48, 47] and to ensure their security [178, 30, 203].”
• Public Key Encryption with Keyword Search (2004, unknown): “Recently, Waters et al. [30] showed that public key encryption with keyword search can be used to build an encrypted and searchable audit log.”
• Achieving Efficient Conjunctive Keyword Searches over Encrypted Data (2005, background): “To address this dilemma, a number of techniques have been recently proposed for achieving a less stringent storage model, one based on the notion of secure, delegated, searchable encryption (e.g., [28,17,12,10,29]).”
• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “showed that encrypted and searchable audit log system can be efficiently constructed from the public key searchable encryption [31].”
• Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, methodology): “The typical construction method of SSE includes the SWP scheme [92], Z-IDX scheme [93] and SSE-1 scheme [94] which are based on pseudo random function, bloom filter, and pseudo random permutation, respectively.”
• Secure Conjunctive Keyword Search over Encrypted Data (2004, background): “An efficient implementation of a public key scheme for keyword search tailored for documents that are the audit trails of users querying a database is in [17].”