IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Cryptography and Information Security
No-Dictionary Searchable Symmetric Encryption
Wakaha OGATAKaoru KUROSAWA
Author information
JOURNALS FREE ACCESS

2019 Volume E102.A Issue 1 Pages 114-124

Details
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 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.

Information related to the author
© 2019 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top