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
Posted Content
Iris: A Scalable Cloud File System with Efficient Integrity Checks.
Proceedings Article
Memory delegation
TL;DR: Goldwasswer et al. as discussed by the authors consider the problem of delegating computation, where the delegator doesn't even know the input to the function being delegated, and runs in time significantly smaller than the input length.
Journal ArticleDOI
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Carmit Hazay,Yehuda Lindell +1 more
TL;DR: In this paper, the authors proposed a secure set intersection and pattern matching algorithm based on secure pseudorandom function evaluation. But their results are presented in two adversary models: one is simulatable and the other is not.
Posted Content
Towards Practical Oblivious RAM
TL;DR: In this article, the authors proposed an O-RAM construction achieving an amortized overhead of 20X-35X (for an ORAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme.
Proceedings ArticleDOI
Secure text processing with applications to private DNA matching
Jonathan Katz,Lior Malka +1 more
TL;DR: It is shown how to modify Yao's garbled circuit approach to obtain a protocol where the size of the garbling circuit is linear in the number of occurrences of p in T (rather than linear in $|T|$).