A SCF-PEKS Scheme without Random Oracle under Simple Assumption

The model of public key encryption with keyword search (PEKS) proposed by Boneh et al. enables one to search encrypted keywords without revealing any information on the data. Baek et al. proposed an enhanced model called secure channel-free PEKS (SCF-PEKS) to removes the costly secure channel. However, most of the presented SCF-PEKS schemes were proved secure in the random oracle model. In 2009, Fang et al. presented a SCF-PEKS scheme without random oracles. But the scheme requires a strong and complicated assumption. In this paper, we propose a SCF-PEKS scheme that is under simple assumption in the standard model.