No-Dictionary Searchable Symmetric Encryption

Wakaha OGATA  Kaoru KUROSAWA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.1   pp.114-124
Publication Date: 2019/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.114
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
searchable symmetric encryption,  dictionary,  verifiable,  search pattern,  

Full Text: FreePDF

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 wW. In particular, it takes only O(1) time for the server to prove that wW. We next present a no-dictionary SSE scheme such that the client can hide even the search pattern from the server.