An efficient certificateless signature scheme

Citation

Yap, Wun She and Heng, Swee Huay and Goi, Bok Min (2006) An efficient certificateless signature scheme. In: Emerging Directions in Embedded and Ubiquitous Computing. Lecture Notes in Computer Science (4097). Springer Berlin Heidelberg, pp. 322-331. ISBN 978-3-540-36851-9

[img] Text
An efficient certificateless signature scheme.pdf
Restricted to Repository staff only

Download (192kB)

Abstract

Certificateless public key cryptography (CLPKC) is a paradigm to solve the inherent key escrow problem suffered by identity-based cryptography (IBC). While certificateless signature is one of the most important security primitives in CLPKC, there are relatively few proposed schemes in the literature. In this paper, we manage to construct an efficient certificateless signature scheme based on the intractability of the computational Diffie-Hellman problem. By using a shorter public key, two pairing computations can be saved in the verification algorithm. Besides, no pairing computation is needed in the signing algorithm. The proposed scheme is existential unforgeable in the random oracle model. We also present an extended construction whose trust level is the same as that of a traditional signature scheme.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering (FOE)
Faculty of Information Science and Technology (FIST)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 10 Aug 2011 07:05
Last Modified: 03 Mar 2015 08:01
URII: http://shdl.mmu.edu.my/id/eprint/2020

Downloads

Downloads per month over past year

View ItemEdit (login required)