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
Patent
String Matching in Encrypted Data
TL;DR: In this paper, a string matching application can compute, for each row of the dataset, a sum of some function of dataset bits and query bits for a row result, and multiply the row results of the computed rows to determine matching strings.
Journal ArticleDOI
Achieve Efficient and Verifiable Conjunctive and Fuzzy Queries over Encrypted Data in Cloud
TL;DR: A new verifiable SE scheme for encrypted cloud storage is proposed, characterized by integrating various techniques, i.e., bitmap index, radix tree, format preserving encryption, keyed-hash message authentication code and symmetric key encryption, for achieving efficient and verifiable conjunctive and fuzzy queries over encrypted data in the cloud.
Proceedings ArticleDOI
Storage Efficient Substring Searchable Symmetric Encryption
Iraklis Leontiadis,Ming Li +1 more
TL;DR: This work revisits the work of substring searchable encryption in order to reduce the storage cost of auxiliary data structures and proposes a suffix array based index design, which allows optimal storage cost $O(n)$ with small hidden factor at the size of the string n.
Book ChapterDOI
SWiM: Secure Wildcard Pattern Matching from OT Extension
TL;DR: In this paper, secure wildcard pattern matching (WPM) is introduced, where the receiver's pattern is allowed to contain wildcards that match to any character. But the receiver cannot learn the locations in the long text where the pattern appears, while leaking nothing else to either party besides the length of their inputs.
Proceedings ArticleDOI
Encryption techniques: A theoretical overview and future proposals
TL;DR: This paper provides a theoretical overview of various encryption techniques, namely those that range from changes in the position of a letter or word, to word transformations and transposition, and proposes the usage of methods to prevent online security breaches.
References
More filters
Book ChapterDOI
Introduction to Algorithms
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Book
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
TL;DR: In this paper, the authors introduce suffix trees and their use in sequence alignment, core string edits, alignments and dynamic programming, and extend the core problems to extend the main problems.
Journal ArticleDOI
Efficient string matching: an aid to bibliographic search
TL;DR: A simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text that has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.