Paper 2015/251

How to Construct UC-Secure Searchable Symmetric Encryption Scheme

Kaoru Kurosawa and Yasuhiro Ohtaki

Abstract

A searchable symmetric encryption (SSE) scheme allows a client to store a set of encrypted files on an untrusted server in such a way that he can efficiently retrieve some of the encrypted files containing (or indexed by) specific keywords keeping the keywords and the files secret. In this paper, we first extend the model of SSE schemes to that of verifiable SSE schemes, and formulate the UC security. We then prove its weak equivalence with privacy and reliability. Finally we show an efficient verifiable SSE scheme which is UC-secure.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Major revision. FC 2012
Keywords
searchable symmetric encryptionUC-securitysymmetric-key encryption
Contact author(s)
kurosawa @ mx ibaraki ac jp
History
2015-03-20: revised
2015-03-19: received
See all versions
Short URL
https://ia.cr/2015/251
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/251,
      author = {Kaoru Kurosawa and Yasuhiro Ohtaki},
      title = {How to Construct UC-Secure  Searchable Symmetric Encryption Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2015/251},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/251}},
      url = {https://eprint.iacr.org/2015/251}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.