Secure Certificateless Signature Scheme with Batch Verification from Bilinear Pairings

Abstract

In view of simplifying certificate management complexities in the traditional Public Key Cryptography (PKC) and to abolish the key escrow problem in identity based PKC (ID-PKC), concept of Certificateless Public Key Cryptography (CL-PKC) was introduced. Batch Cryptography emphasizes new developments in information security and communication networks. It has been developed to enhance the efficiency of signatures verification, by verifying a batch of n message, signature pairs in a single instance. Batch Verification (BV) can be used in various areas where many clients interact with a single server. Mail servers, Sensor Networks, e-commerce are the best examples for BV. In this paper, we present a certificateless signature (CLS) scheme that supports BV using pairings. The proof of security is presented in Random Oracle Model (ROM) under the assumption of Computational Diffie-Hellman (CDH) Problem is intractable. More over the security proofs are made without using forking lemma [20] to achieve tight security. The efficiency analysis shows that our CLS scheme is more secure and efficient than the existing schemes.