Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2014, Article ID 792063, 6 pages
Research Article

Pairing-Free Certificateless Signature with Security Proof

Hangzhou Key Laboratory of Cryptography and Network Security, Hangzhou Normal University, Hangzhou, Zhejiang 311121, China

Received 30 May 2014; Revised 6 November 2014; Accepted 6 November 2014; Published 26 November 2014

Academic Editor: Tzonelih Hwang

Copyright © 2014 Wenhao Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Since certificateless public key cryptosystem can solve the complex certificate management problem in the traditional public key cryptosystem and the key escrow problem in identity-based cryptosystem and the pairing computation is slower than scalar multiplication over the elliptic curve, how to design certificateless signature (CLS) scheme without bilinear pairings is a challenge. In this paper, we first propose a new pairing-free CLS scheme, and then the security proof is presented in the random oracle model (ROM) under the discrete logarithm assumption. The proposed scheme is more efficient than the previous CLS schemes in terms of computation and communication costs and is more suitable for the applications of low-bandwidth environments.