Secure Certificateless Signature Scheme with Batch Verification from Bilinear Pairings

  • N. B. GayathriEmail author
  • P. Vasudeva Reddy
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 625)


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.


Public key cryptography CLS scheme Batch verification Bilinear pairing ROM CDH problem 



The authors are grateful and sincerely thank the reviewers for their valuable suggestions. This work is supported by WOS-A, DST, Govt. of India under the grant No.SR/WOS-A/PM-1033/2014 (G), WOS-A, DST.


  1. 1.
    Al-Riyami, Sattam S., Paterson, Kenneth G.: Certificateless public key cryptography. In: Laih, Chi-Sung (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Barreto, Paulo S.L.M., Kim, Hae Y., Lynn, Ben, Scott, Michael: Efficient algorithms for pairing-based cryptosystems. In: Yung, Moti (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Bellare, Mihir, Garay, Juan A., Rabin, Tal: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, Kaisa (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Cao, X., Kou, W., Du, X.: A Pairing –free Identity Based Authenticated Key Agreement Protocol with Minimal Message Exchanges. Inf. Sci. 180(15), 2895–2903 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fan, C.I., Ho, P.H., Tseng, Y. F.: Strongly secure certificateless signature scheme supporting batch verification In: Mathematical Problems in Engineering, vol. 2014, Article ID 854135, 11 pages. Hindawi Publishing Corporation. (2014)
  6. 6.
    Fiat, A.: “Batch RSA,” in Advances in cryptology-CRYPTO, pp. 175–185. (1990)Google Scholar
  7. 7.
    Geng, M., Zhang, F.: Batch verification for certificateless signature schemes. In: Proceedings of the International Conference on Computational Intelligence and Security (CIS 2009), pp. 288– 292, December. 2009Google Scholar
  8. 8.
  9. 9.
    Naccache, David, Raihi, DavidM, Vaudenay, Serge, Raphaeli, Dan: Can D.S.A. be improved? In: De Santis, Alfredo (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 77–85. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  10. 10.
    Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology 13(3), 361–369 (2000)CrossRefzbMATHGoogle Scholar
  11. 11.
    Shim, K.A.: Security models for certificateless signature schemes revisted. Inf. Sci. 296, 315–321 (2015)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Tan, S-Y., Heng, S-H., Goi, B-M.: Java implementation for pairing-based cryptosystems. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA 2010, Part IV. LNCS, vol. 6019, pp. 188–198. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Yoon, HyoJin, Cheon, Jung Hee, Kim, Yong-Dae: Batch verifications with id-based signatures. In: Park, Choon-sik, Chee, Seongtaek (eds.) ICISC 2004. LNCS, vol. 3506, pp. 233–248. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  1. 1.Department of Engineering MathematicsAndhra UniversityVisakhapatnamIndia

Personalised recommendations