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(n~2) substrings in an index. In this paper, we present a secure and efficient substring search scheme on encrypted documents.
展开▼
