Efficient Public Key Encryption with Keyword Search Schemes from Pairings.

Public key encryption with keyword search (PEKS) scheme to enable one to search encrypted keywords without compromising the security of the original data. In this paper, we propose a new PEKS scheme based on bilinear pairings. The scheme is computationally consistent. There is no pairing operation involved in the encryption procedure and so our new PEKS scheme is more efficient than the scheme of Boneh et.al. in [1]. Then, we provide further discussions on removing secure channel from PEKS, and present an efficient secure channel free PEKS scheme. Our two new schemes can be proved secure in the random oracle model, under the appropriate computational assumptions. [ABSTRACT FROM AUTHOR]