Cryptology ePrint Archive: Report 2014/614

Expressive and Secure Searchable Encryption in the Public Key Setting (Full Version)

Zhiquan Lv and Cheng Hong and Min Zhang and Dengguo Feng

Abstract: Searchable encryption allows an untrusted server to search on encrypted data without knowing the underlying data contents. Traditional searchable encryption schemes focus only on single keyword or conjunctive keyword search. Several solutions have been recently proposed to design more expressive search criteria, but most of them are in the setting of symmetric key encryption. In this paper, based on the composite-order groups, we present an expressive and secure asymmetric searchable encryption (ESASE) scheme, which is the first that simultaneously supports conjunctive, disjunctive and negation search operations. We analyze the efficiency of ESASE and prove it is secure under the standard model. In addition, we show that how ESASE could be extended to support the range search and the multi-user setting.

Category / Keywords: Searchable Encryption, Asymmetric Searchable Encryption, Expressive Search

Date: received 11 Aug 2014, last revised 13 Aug 2014

Contact author: lvzhiquan at tca iscas ac cn

Available format(s): PDF | BibTeX Citation

Version: 20140814:005641 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]