Symmetric searchable encryption (SSE) is a method which searches encrypted data without decrypting it, and several SSE schemes have been proposed. However, most of them support only exact keyword search. To search for any substring in a document, we must register all substrings of the document in an index. Hence if the length of a document is n, we must register O(n2) substrings in an index. In this paper, we present a secure and efficient substring search scheme on encrypted documents.
CITATION STYLE
Yamamoto, H. (2016). Secure automata-based substring search scheme on encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9836, pp. 111–131). Springer Verlag. https://doi.org/10.1007/978-3-319-44524-3_7
Mendeley helps you to discover research relevant for your work.