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
Privacy-Preserving Substring Search on Multi-Source Encrypted Gene Data
TL;DR: A cryptographic scheme that supports privacy-preserving substring search on multi-source encrypted gene data that adopts the composite order bilinear map as the primary underlying cryptographic primitive and provides a security analysis under the honest-but-curious model.
Patent
Encryption device, encryption method, computer readable medium, and storage device
Takato Hirano,Yutaka Kawai +1 more
TL;DR: A data partition unit partitions character string data D into N pieces of element data w1, w2,...,, wN from a front to an end of the character string D.
Patent
Secure substring search to filter encrypted data
TL;DR: Secure substring searching on encrypted data may involve a first preprocessing comprising fragmenting a plaintext string for remote secure storage, in a plurality of overlapping plaintext substrings as mentioned in this paper.
Posted Content
A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing.
TL;DR: In this article, the authors introduce the notion of a Functionally Encrypted Datastore (FED) which collects data anonymously from multiple data-owners, stores it encrypted on an untrusted server, and allows untranstrusted clients to make select-and-compute queries on the collected 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.