Paper 2016/981

Efficient No-dictionary Verifiable SSE

Wakaha Ogata and Kaoru Kurosawa

Abstract

In the model of "no-dictionary" verifiable searchable symmetric encryption (SSE) scheme, a client does not need to keep the set of keywords W in the search phase, where W is called a dictionary. Still a malicious server cannot cheat the client by saying that ``your search word w does not exist in the dictionary W" when it exists. In the previous such schemes, it takes O(logm) time for the server to prove that wW, where m=|W| is the number of keywords. In this paper, we show a generic method to transform any SSE scheme (that is only secure against passive adversaries) to a no-dictionary verifiable SSE scheme. In the transformed scheme, it takes only O(1) time for the server to prove that wW.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
searchable symmetric encryptionverifiabledictionary
Contact author(s)
ogata w aa @ m titech ac jp
History
2016-10-15: received
Short URL
https://ia.cr/2016/981
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/981,
      author = {Wakaha Ogata and Kaoru Kurosawa},
      title = {Efficient No-dictionary Verifiable {SSE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/981},
      year = {2016},
      url = {https://eprint.iacr.org/2016/981}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.