Paper 2014/614
Expressive and Secure Searchable Encryption in the Public Key Setting (Full Version)
Zhiquan Lv, Cheng Hong, 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Searchable EncryptionAsymmetric Searchable EncryptionExpressive Search
- Contact author(s)
- lvzhiquan @ tca iscas ac cn
- History
- 2014-08-14: last of 2 revisions
- 2014-08-13: received
- See all versions
- Short URL
- https://ia.cr/2014/614
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/614,
author = {Zhiquan Lv and Cheng Hong and Min Zhang and Dengguo Feng},
title = {Expressive and Secure Searchable Encryption in the Public Key Setting (Full Version)},
howpublished = {Cryptology ePrint Archive, Paper 2014/614},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/614}},
url = {https://eprint.iacr.org/2014/614}
}
