Title
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.
Year
DOI
Venue
2015
10.1080/00207160.2014.957196
International Journal of Computer Mathematics
Keywords
Field
DocType
94A60, 11T71, 68R99, 94A62, 14G50, no key escrow, discrete logarithm, provable secure, pairing-free, certificateless identification
Key generation,Mathematical optimization,Identification scheme,Computer network,Theoretical computer science,Pairing,Certificate Management Protocol,Key escrow,Mathematics,Bilinear interpolation,Discrete logarithm
Journal
Volume
Issue
ISSN
92
8
0020-7160
Citations 
PageRank 
References 
0
0.34
11
Authors
5
Name
Order
Citations
PageRank
Ji-Jian Chin16024.41
Syh-Yuan Tan23720.43
Swee-Huay Heng338447.50
Raphael C.-W. Phan470366.89
Rouzbeh Behnia555.56