A provable secure pairing-free certificateless identification scheme

Abstract

Certificateless identification (CLI) schemes offer an alternative solution to the certificate management problem of traditional identification schemes, as well as remove the key escrow from key generation, an inherent property of identity-based identification. In this paper, we provide a pairing-free CLI scheme, provable secure against passive and active/concurrent attacks for both Type-1 and Type-2 adversaries. This shows that our scheme is computationally efficient because no bilinear pairings are involved.

Keywords:

• certificateless identification
• pairing-free
• provable secure
• no key escrow
• discrete logarithm

2010 AMS Subject Classifications:

• 94A60
• 94A62
• 14G50
• 11T71
• 68R99

Acknowledgements

This research was funded by Ministry of Higher Education Malaysia through the Exploratory Research Grant Scheme ERGS/1/2011/PK/MMU/03/1 and the Fundamental Research Grant Scheme FRGS/2/2013/ICT07/MMU/03/5.