Efficient public key encryption with revocable keyword search

Public key encryption with keyword search (PEKS) is a novel cryptographic primitive enabling one to search

on the encrypted data directly. In the known schemes, once getting a trapdoor, the server can search associated

data without any restrictions. However, in reality, it is sometimes essential to prevent the server from searching

the data all the time since the server is not fully trusted. In this paper, we propose the notion of public

key encryption with revocable keyword search (PERKS) to address the issue. We also develop a concrete

construction by dividing the whole life of the system into distinct time periods to achieve our goals. The

proposed scheme achieves the properties of IND-CKA security under the Co-DBDH assumption in our security

model. Compared with two somewhat schemes, ours oers much better performance in terms of computational

cost.