Cryptology ePrint Archive: Report 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.
Category / Keywords: secret-key cryptography / searchable symmetric encryption, UC-security, symmetric-key encryption
Original Publication (with major differences): FC 2012
Date: received 17 Mar 2015, last revised 19 Mar 2015
Contact author: kurosawa at mx ibaraki ac jp
Available format(s): PDF | BibTeX Citation
Version: 20150320:013458 (All versions of this report)
Short URL: ia.cr/2015/251
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]