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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
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)
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)
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)
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. http://dx.doi.org/10.1155/2014/854135. (2014)
Fiat, A.: “Batch RSA,” in Advances in cryptology-CRYPTO, pp. 175–185. (1990)
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. 2009
MIRACL Library. http://certivox.org/display/EXT/MIRACL
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)
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptology 13(3), 361–369 (2000)
Shim, K.A.: Security models for certificateless signature schemes revisted. Inf. Sci. 296, 315–321 (2015)
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)
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)
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Gayathri, N.B., Vasudeva Reddy, P. (2016). Secure Certificateless Signature Scheme with Batch Verification from Bilinear Pairings. In: Mueller, P., Thampi, S., Alam Bhuiyan, M., Ko, R., Doss, R., Alcaraz Calero, J. (eds) Security in Computing and Communications. SSCC 2016. Communications in Computer and Information Science, vol 625. Springer, Singapore. https://doi.org/10.1007/978-981-10-2738-3_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-2738-3_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2737-6
Online ISBN: 978-981-10-2738-3
eBook Packages: Computer ScienceComputer Science (R0)