Dynamic searchable symmetric encryption

By Seny Kamara, Charalampos Papamanthou, T. Roeder. IACR Cryptology ePrint Archive, 2012

1,156 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/7306de2d77d15af3eff4adf285247e586b6016da

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 Computational Theory and Mathematics

In Information Systems

Citations in the corpus

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.”
BlindBox: Deep Packet Inspection over Encrypted Traffic (2015, methodology): “The second class of computation can support all DPI applications, including those which perform regular expressions or scripting.”
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 Encryption in Very-Large Databases: Data Structures and Implementation (2014, methodology): “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.”
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.”
∑oφoς: Forward Secure Searchable Encryption (2016, methodology): “The conﬁdentiality deﬁnition of an SSE scheme uses the real world versus ideal world formalization [CGKO06, KPR12, CJJ + 14].”
Dynamic Searchable Encryption via Blind Storage (2014, methodology): “Later, in Section V-B, we show how to build a Dynamic SSE scheme using a Blind Storage system.”
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, methodology): “This is typically captured using a real-world versus ideal-world formalization [CGKO06, KPR12, CJJ + 14].”
IoT-Based Big Data Storage Systems in Cloud Computing: Perspectives and Challenges (2017, methodology): “In [42], a data scheme that extends the inverted index approach is proposed to combines with techniques for the design of SSE.”
Data Security and Privacy Protection for Cloud Storage: A Survey (2020, background): “Therefore, how to enable users to search for speciﬁc keywords on encrypted ﬁles securely in the cloud has become the concern of many scholars [5], [46], [48], [52], [76].”
Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage (2014, methodology): “(8)Key-aggregate searchable encryption (KASE) method of data sharing, it consists of two types of users: Data owner and Data user.”
Leakage-Abuse Attacks Against Searchable Encryption (2015, background): “If the SE scheme is dynamic, then she will also be able to add encrypted documents efficiently [12].”
Practical Dynamic Searchable Encryption with Small Leakage (2014, background): “[36] has the limitations of both [21] and [20], with leaky updates and a large index.”
Privacy and Data Protection by Design - from policy to engineering (2014, background): “Also, in [129], the first searchable symmetric encryption scheme was presented that satisfies the following important properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently.”
Blockchain based searchable encryption for electronic health record sharing (2019, methodology): “Such schemes include multi-keyword SSE schemes [4-7], dynamic SSE schemes [8-11] and verifiable SSE schemes [12-16].”
A Survey of Provably Secure Searchable Encryption (2014, neutral): “Khader [2007] constructs a scheme based on k-resilient IBE [Heng and Kurosawa 2004, 2006].”
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”