By Topic

An Efficient Certificateless Signature Scheme from Bilinear Parings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fengyin Li ; Sch. of Inf. Sci. & Eng., Shandong Normal Univ., Jinan, China ; Peiyu Liu

A Certificateless signature scheme retains the efficiency of Shamir's, but it avoids the inherent key-escrow problem of the identity-based signature scheme. In this paper, we will propose a new Certificateless signature scheme from bilinear pairings. The proposed scheme is much more efficient than those previous Certificateless signature schemes by avoiding the Map to Point hash functions and decreasing the number of the bilinear pairing map operations. In the signing phase, no bilinear pairing operations are needed, and in the verifying phase, only 2 bilinear pairing operations are needed. All this contributes to the efficiency of the proposed scheme. The proposed scheme is unforgeable under the hardness assumptions of the q-strong Diffie-Hellman problem and the computational Diffie-Hellman problem.

Published in:

Network Computing and Information Security (NCIS), 2011 International Conference on  (Volume:1 )

Date of Conference:

14-15 May 2011