An Efficient and Provable Secure Certificateless Identification Scheme in the Standard Model

• Ji-Jian Chin,
• Swee-Huay Heng,
• Raphael C.-W. Phan,

Vol. 8, No. 7, July 28, 2014
10.3837/tiis.2014.07.019, Download Paper (Free):

• cryptography
• Privacy/Authorization/Authentication
• Certificateless Identification
• standard model
• proof of security

Abstract

In Asiacrypt 2003, Al-Riyami and Paterson proposed the notion of certificateless cryptography, a technique to remove key escrow from traditional identity-based cryptography as well as circumvent the certificate management problem of traditional public key cryptography. Subsequently much research has been done in the realm of certificateless encryption and signature schemes, but little to no work has been done for the identification primitive until 2013 when Chin et al. rigorously defined certificateless identification and proposed a concrete scheme. However Chin et al.’s scheme was proven in the random oracle model and Canetti et al. has shown that certain schemes provable secure in the random oracle model can be insecure when random oracles are replaced with actual hash functions. Therefore while having a proof in the random oracle model is better than having no proof at all, a scheme to be proven in the standard model would provide stronger security guarantees. In this paper, we propose the first certificateless identification scheme that is both efficient and show our proof of security in the standard model, that is without having to assume random oracles exist.

Statistics

Cite this article