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
On developing dynamic and efficient cryptosystem for safeguarding healthcare data in public clouds
L. Selvam,J. Arokia Renjit +1 more
TL;DR: Two dynamic and efficient cryptosystems for secure storage and access of medical data and another approach for developing a key management system, which will effectively handle the allocation of encryption and decryption keys for all the people who are handling the sensitive medical data of the patients are proposed.
Journal ArticleDOI
Online parameterized dictionary matching with one gap
Avivit Levy,B. Riva Shalom +1 more
TL;DR: This work defines and study the strict PDMOG problem, in which sub-patterns of the same dictionary pattern should be parameterized matched via the same bijection, which captures situations where sub- patterns of a dictionary pattern are encoded simultaneously.
Book ChapterDOI
Secure Automata-Based Substring Search Scheme on Encrypted Data
TL;DR: This paper presents a secure and efficient substring search scheme on encrypted documents and shows how to register all substrings of the document in an index to search for any substring.
Proceedings ArticleDOI
Privacy preserving substring search protocol with polylogarithmic communication cost
TL;DR: This work presents a privacy-preserving substring search protocol exhibiting a sub-linear communication cost, with a limited computational effort on the server side, and its extension to a multi-user setting shows significant savings in terms of outsourced storage w.r.t. a baseline solution where the whole dataset is replicated.
Journal ArticleDOI
Secure string pattern query for open data initiative
TL;DR: This paper designs an efficient and secure indexing structure called S2PAStree and proposes a set of secure index construction protocols under the scenario that multiple data owners share and integrate their sensitive data.
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.