Parallel and Dynamic Searchable Symmetric Encryption

By Seny Kamara, Charalampos Papamanthou. Financial Cryptography, 2013

547 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

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

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

In Computer Vision and Pattern Recognition

Citations in the corpus

∑oφoς: Forward Secure Searchable Encryption (2016, background): “Kamara and Papamanthou [KP13] later improved this construction, and reduced the leakage at the cost of increased space complexity on the server.”
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation (2014, background): “While this is a drawback, all known dynamic SSE schemes [14], [15], [21] have severe drawbacks in different dimensions, and no scheme has achieved an ideal combination of leakage, index size, and full functionality like reclaiming space.”
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.”
Practical Dynamic Searchable Encryption with Small Leakage (2014, methodology): “[36] has the limitations of both [21] and [20], with leaky updates and a large index.”
Data Security and Privacy-Preserving in Edge Computing Paradigm: Survey and Open Issues (2018, methodology): “[55] further proposed the parallel and dynamic searchable symmetric encryption method [118] based on a new tree-based multimap data structure which called Keyword Red-Black (KRB) tree.”
Security and Privacy in the Internet of Things (2017, background): “During the past decade, many provably secure SSE schemes [56, 147, 48, 94, 93, 118, 47, 81, 135] have been proposed, which make trade-offs among security, search performance and storage overhead by exploring static- [56, 147, 48] and dynamic datasets [94, 93, 118, 47, 81, 135] as well as various dat”
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.”
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives (2017, result): “Even though the dynamic setting had been studied earlier, Kamara and Papamanthou [KP13] designed the ﬁrst sublinear dynamic scheme.”