Efficient revocable certificateless encryption against decryption key exposure

Certificateless public key cryptosystem (CLPKC) improves the identity based public key cryptosystem to be key-escrow free. Many research works on CLPKC have been presented so far. However, the revocation problem in CLPKC still lacks effective solutions. The current revocation approaches suffer from either low efficiency or security weakness. In this study, we propose the first `scalable revocable´ certificateless encryption (RCLE) scheme against `decryption key exposure´. The scheme is provably secure in the standard model. Moreover, we give a second interesting RCLE scheme whose decryption key is very short.