A provable secure pairing-free certificateless identification scheme

Ji Jian Chin, Syh Yuan Tan, Swee Huay Heng, Raphael C.W. Phan, Rouzbeh Behnia

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1520-1535
Number of pages16
JournalInternational Journal of Computer Mathematics
Issue number8
Publication statusPublished - 3 Aug 2015
Externally publishedYes


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

Cite this