Secure Indexes

By Eu-Jin Goh. IACR Cryptology ePrint Archive, 2003

1,178 citations recorded by the source corpus.

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

How researchers see this paper

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

Citations in the corpus

A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data (2016, methodology): “Due to the special structure of our tree-based index, the proposed search scheme can flexibly achieve sublinear search time and deal with the deletion and insertion of documents.”
Efficient Similarity Search over Encrypted Data (2012, background): “The shortcomings of [2] and [6] have been addressed in [4], where Curtmola et. al. presented adaptive security deﬁnition for searchable encryption schemes.”
Authorized Private Keyword Search over Encrypted Data in Cloud Computing (2011, background): “Later, various schemes [18], [14], [15], [37] were proposed where a searchable encrypted index is usually created, so that the encrypted documents can be searched given a capability.”
Privacy-preserving multi-keyword ranked search over encrypted cloud data (2011, background): “[5] in the symmetric key setting, and improvements and advanced security definitions are given in Goh [6], Chang et al.”
Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation (2012, background): “Unfortunately, Bloom Filters can lead to false positives, a fact the authors themselves pointed out in [10].”
"Better Than Nothing" Privacy with Bloom Filters: To What Extent? (2012, background): “[12]; composability of the Pohlig-Hellman cipher [10, 11]; blind signatures and oblivious pseudorandom functions [13]; Boneh-Goh-Nissim public key encryption [14]; etc.”
Secure Conjunctive Keyword Search over Encrypted Data (2004, methodology): “Recent improvements and extensions to this scheme are given in [3, 9, 17].”
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.”
All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption (2016, background): “Our attacks outperform prior work significantly in terms of their effectiveness as well as in terms of their assumptions about the attacker’s prior knowledge.”
Dynamic searchable symmetric encryption (2012, background): “Searchable symmetric encryption (SSE) allows a client to encrypt data in such a way that it can later generate search tokens to send as queries to a storage server.”
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.”
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation (2014, background): “Many recent works [3]–[5], [7], [9], [14], [15], [17], [19], [21] studied SSE and provided solutions with varying trade-offs between security, efficiency, and the ability to securely update the data after it has been encrypted and uploaded.”
Searchable symmetric encryption: Improved definitions and efficient constructions (2006, unknown): “We sometimes refer to D ( w ) as the outcome of a search for w and to the sequence ( D ( w 1 ) , . . . , D ( w n )) as the access pattern of a client.”
Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement (2016, background): “However, the cloud server is honest-but-curious as in [12]–[14].”