Authors: Sun Yinxia; Zhang Zhuoran; Shen Limin
Addresses: School of Computer Science and Technology, Nanjing Normal University, Nanjing, China ' School of Mathematics Science, Nanjing Normal University, Nanjing, China ' Department of Mathematics and Computer Science, Nanjing Normal University, Nanjing, China
Abstract: Featuring no key escrow and no certificate, certificateless public key cryptography (CLPKC) has received much attention. A necessary problem in CLPKC is how to revoke a compromised/misbehaving user, which still remains to be efficiently solved: all existing methods are not practical for use owing to either enormous computation (secret channels), or a costly mediator. In this paper, we present a new approach for revocation in CLPKC and give a revocable certificateless encryption (RCLE) scheme. In the new scheme, a user's private key contains three parts: an initial partial private key, a time key and a secret value. The time key is updated at every time period and is transmitted over a public channel. Our construction offers higher performance than previous solutions. Based on the bilinear Diffie-Hellman problem, our RCLE scheme is provably secure in the random oracle model.
Keywords: revocation; certificateless encryption; bilinear Diffie-Hellman problem; random oracle model.
International Journal of High Performance Computing and Networking, 2018 Vol.11 No.1, pp.83 - 91
Available online: 11 Dec 2017Full-text access for editors Access for subscribers Free access Comment on this article