No-dictionary searchable symmetric encryption

Abstract

In the model of no-dictionary searchable symmetric encryption (SSE) schemes, the client does not need to keep the list of keywords W. In this paper, we first show a generic method to transform any passively secure SSE scheme to a no-dictionary SSE scheme such that the client can verify search results even if w < W. In particular, it takes only O(1) time for the server to prove that w < W. We next present a no-dictionary SSE scheme such that the client can hide even the search pattern from the server.