Structured Encryption and Controlled Disclosure

By Melissa Chase, Seny Kamara. IACR Cryptology ePrint Archive, 2010

560 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/3f18a02d900b6871fdf11f4dfbf0335bf62d1951

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

Citations in the corpus

Generic Attacks on Secure Outsourced Databases (2016, methodology): “To be more general, we follow a formalization of Chase and Kamara [14] in the context of “structured encryption.””
A Survey of Provably Secure Searchable Encryption (2014, methodology): “Chase and Kamara [2010] (CK) proposed an adaptively secure construction that is based on CGK+-I.”
Dynamic searchable symmetric encryption (2012, methodology): “While there are several CKA2-secure SSE schemes [8, 23, 6, 21], they all have limitations from a practical point of view.”
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013, methodology): “We recall the semantic security definitions from [8,7].”
Practical Dynamic Searchable Encryption with Small Leakage (2014, result): “The scheme of Kamara and Papamanthou [20] overcomes the above limitation (still not achieving forward privacy) by increasing the space of the used data structure.”
Parallel and Dynamic Searchable Symmetric Encryption (2013, methodology): “Curtmola et al [6]. gave the first constructions (SSE-1 and SSE-2) to achieve sub-linear (and in fact optimal) search time.”
Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives (2017, background): “Note that SSE is a particular case of structured encryption, as deﬁned by Chase and Kamara [CK10], focused on multi-maps ( a.k.a. T-Sets or reversed index).”
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation (2014, methodology): “RELATION TO [5] A prior SSE scheme by Chase and Kamara used a dictionary, but in a crucially different way.”
Foundations of garbled circuits (2012, methodology): “A garbling scheme is provided in KW, but not a “conventional” one: it garbles a structured circuit and is based on a collection of structured encryption schemes , a notion from Chase and Kamara [17].”
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).”