Substring-Searchable Symmetric Encryption
Melissa Chase,Emily Shen +1 more
- Vol. 2015, Iss: 2, pp 263-281
Reads0
Chats0
TLDR
It is proved security of the substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.Abstract:
In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE) and structured encryption. Then, we construct a queryable encryption scheme for substring queries. Our construction uses suffix trees and achieves asymptotic efficiency comparable to that of unencrypted suffix trees. Encryption of a string of length n takes O(λn) time and produces a ciphertext of size O(λn), and querying for a substring of length m that occurs k times takes O(λm + k) time and three rounds of communication. Our security definition guarantees correctness of query results and privacy of data and queries against a malicious adversary. Following the line of work started by Curtmola et al. (ACM CCS 2006), in order to construct more efficient schemes we allow the query protocol to leak some limited information that is captured precisely in the definition. We prove security of our substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.read more
Citations
More filters
Journal ArticleDOI
Searchable Symmetric Encryption: Designs and Challenges
TL;DR: This work seeks to address the gap in detail how SSE’s underlying structures are designed and how these result in the many properties of a SSE scheme, as well as presenting recent state-of-the-art advances on SSE.
Posted Content
SoK: Cryptographically Protected Database Search
Benjamin Fuller,Mayank Varia,Arkady Yerukhimovich,Emily Shen,Ariel Hamlin,Vijay Gadepally,Richard Shay,John Darby Mitchell,Robert K. Cunningham +8 more
TL;DR: In this paper, the authors identify the important primitive operations across database paradigms and evaluate the current state of protected search systems in implementing these base operations, and present a roadmap and tools for transforming a protected search system into a protected database.
Proceedings ArticleDOI
SoK: Cryptographically Protected Database Search
Benjamin Fuller,Mayank Varia,Arkady Yerukhimovich,Emily Shen,Ariel Hamlin,Vijay Gadepally,Richard Shay,John Darby Mitchell,Robert K. Cunningham +8 more
TL;DR: An evaluation of the current state of protected search systems and describes the main approaches and tradeoffs for each base operation, which puts protected search in the context of unprotected search, identifying key gaps in functionality.
Proceedings ArticleDOI
Privacy-preserving pattern matching over encrypted genetic data in cloud computing
TL;DR: This paper starts from a practical system model of the personalize medicine and presents a solution for the secure DNA sequence matching problem in cloud computing and proves that the scheme is secure under the well-defined cryptographic assumption, i.e., the sub-group decision assumption over a bilinear group.
Journal ArticleDOI
Practical-oriented protocols for privacy-preserving outsourced big data analysis: Challenges and future research directions
TL;DR: This paper surveys the state-of-the-art literature on cryptographic solutions designed to ensure the security and/or privacy in big data outsourcing and provides concrete examples to explain how these cryptographic solutions can be deployed.
References
More filters
Book ChapterDOI
Predicate Privacy in Encryption Systems
TL;DR: A symmetric-key predicate encryption scheme which supports inner product queries and it is proved that the scheme achieves both plaintext privacy and predicate privacy.
Book ChapterDOI
Parallel and Dynamic Searchable Symmetric Encryption
TL;DR: In this paper, a sub-linear searchable symmetric encryption (SSE) scheme is presented, which is based on the inverted index approach and achieves sublinear time search.
Book ChapterDOI
Structured Encryption and Controlled Disclosure
Melissa Chase,Seny Kamara +1 more
TL;DR: The notion of structured encryption is introduced which generalizes previous work on symmetric searchable encryption (SSE) to the setting of arbitrarily-structured data.
Journal Article
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
Martín Abadi,Phillip Rogaway +1 more
TL;DR: In this paper, the authors provide a computational justification for a formal treatment of encryption, by providing a computational model that considers complexity and probability of a cryptosystem's security properties.
Book ChapterDOI
Verifiable delegation of computation over large datasets
TL;DR: In this article, the problem of computing on large datasets that are stored on an untrusted server was studied, and the first practical verifiable computation scheme for high degree polynomial functions was presented.