Searchable Public Key Encryption Based on RSA Assumption and Extended to Multi-user Setting

In this paper, we study the problem of keyword searches over asymmetrically encrypted data. Our scheme is based on strong RSA assumption, which provides the high efficient search technique and is proven secure in the standard model. In comparison with previous schemes, our scheme requires only simpler computation without pairing operation, and lower storage overheads on servers and clients. Moreover, most servers are not only about to serve for single user, but to support query and search operations for multiple users. As a result, we extend our scheme to multiuser environment, which provides an efficient search scheme of remote storage for a number of users. Furthermore, we define the secure model for mPEKS scheme and prove the security and availability of our scheme.