New Efficient Searchable Encryption Schemes from Bilinear Pairings

Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the keyword W , but learn nothing else. In this paper, we propose a new PEKS scheme based on bilinear pairings. 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 [5]. 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.