IACR News item: 13 August 2014
Zhiquan Lv, Cheng Hong, Min Zhang, Dengguo Feng
ePrint Reporton 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.
Additional news items may be found on the IACR news page.