Asymmetric searchable encryption from inner product encryption

Abstract

Asymmetric searchable encryption(ASE) enables one to retrieve encrypted data stored on an untrusted server without revealing the contents. Now, beyond single keyword search, more and more attention have already been paid to the problem of multi-keyword search. However, existing schemes are mainly based on composite-order bilinear groups. In this paper, we propose a public key encryption with conjunctive and disjunctive keyword search(PECDK) scheme which can simultaneously support conjunction and disjunction within each keyword field for cloud storage. It is based on prime-order bilinear groups, and can be proved fully secure under the standard model.