Skip to main content

Efficient and short certificateless signatures secure against realistic adversaries

Abstract

The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for certificateless cryptography and many new schemes have been introduced based on the correspondence of the security models. In generally speaking, a stronger security model can ensure a certificateless cryptosystem with a higher security level, but a realistic model can lead to a more efficient scheme. In this paper, we focus on the efficiency of a certificateless signature (CLS) scheme and introduce an efficient CLS scheme with short signature size. On one hand, the security of the scheme is based on a realistic model. In this model, an adversary is not allowed to get any valid signature under false public keys. On the other hand, our scheme is as efficient as BLS short signature scheme in both communication and computation and, therefore, turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely the modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power.

This is a preview of subscription content, access via your institution.

References

  1. Au MH, Chen J, Liu JK, Mu Y, Wong DS, Yang G (2007) Malicious KGC attacks in certificateless cryptography. In: Proceedings of ASIACCS’07, pp 302–311

  2. Al-Riyami SS, Paterson KG (2003) Certificateless public key cryptography. In: Advances in cryptology—ASISCRYPT’03. Lecture notes in computer science, vol 2894. Springer, Berlin, pp 452–473

    Google Scholar 

  3. Barreto PSLM, Kim HY, Lynn B, Scott M (2002) Efficient algorithm for pairing-based cryptosystems. In: Advances in cryptology—CRYPTO’02. Lecture notes in computer science, vol 2442. Springer, Berlin, pp 354–369

    Google Scholar 

  4. Barreto PSLM, Lynn B, Scott M (2003) On the selection of pairing-friendly groups. In: Proceedings of SAC’03. Lecture notes in computer science, vol 3006. Springer, Berlin, pp 17–25

    Google Scholar 

  5. Bellare M, Neven G (2006) Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM conference on computer and communication security, pp 390–398

  6. Bellare M, Palacio A (2004) The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Advances in cryptology—CRYPTO’04. Lecture notes in computer science, vol 3152. Springer, Berlin, pp 273–289

    Google Scholar 

  7. Boneh D, Boyen X (2004) Short signatures without rando oracles. In: Advances in cryptology—EUROCRYPT’04. Lecture notes in computer science, vol 3027. Springer, Berlin, pp 56–73

    Google Scholar 

  8. Boneh D, Lynn B, Shacham H (2001) Short signatures from the weil pairing. In: Advances in cryptology—ASIACRYPT’01. Lecture notes in computer science, vol 2248. Springer, Berlin, pp 514–533

    Google Scholar 

  9. Choi KY, Park JH, Hwang JY, Lee DH (2007) Efficient certificateless signature schemes. In: Proceedings of ACNS’07. Lecture notes in computer science, vol 4521. Springer, Berlin, pp 443–458

    Google Scholar 

  10. Damgård I (1992) Towards practical public key systems secure against chosen ciphertext attacks. In: Advances in cryptology—CRYPTO’91. Lecture notes in computer science, vol 576. Springer, Berlin, pp 445–456

    Google Scholar 

  11. Du H, Wen Q (2009) Efficient and provably-secure certificateless short signature scheme from bilinear pairings. Int J Comput Stand Interfaces 31:390–394

    Article  Google Scholar 

  12. Goldwasser S, Micali S, Rivest RL (1988) A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput 17(2):281–308

    MathSciNet  MATH  Article  Google Scholar 

  13. Gorantla MC, Saxena A (2005) An efficient certificateless signature scheme. In: Proceedings of CIS’05. Lecture notes in artificial intelligence, vol 3802(II). Springer, Berlin, pp 110–116

    Google Scholar 

  14. Hada S, Tanaka T (1998) On the existence of 3-round zero-knowledge protocols. In: Advances in cryptology—CRYPTO’98. Lecture notes in computer science, vol 1462. Springer, Berlin, pp 408–423

    Google Scholar 

  15. Hu BC, Wong DS, Zhang Z, Deng X (2007) Certificatelss signature: a new security model and an improved generic construction. Designs Codes Cryptography 42(2):109–126

    MathSciNet  MATH  Article  Google Scholar 

  16. Huang X, Mu Y, Susilo W, Wong DS, Wu W (2007) Certificateless signature revisted. In: Proceedings of ACISP’07. Lecture notes in computer science, vol 4586. Springer, Berlin, pp 308–322

    Google Scholar 

  17. Huang X, Susilo W, Mu Y, Zhang F (2005) On the security of certificateless signature schemes from Asiacrypt 2003. In: Proceedings of CANS’05. Lecture notes in computer science, vol 3810. Springer, Berlin, pp 13–25

    Google Scholar 

  18. Liu JK, Au MH, Susilo W (2007) Self-generated-certificate public key cryptography and certificateless signature/encryption scheme in the standard model. In: Proceedings of ASIACCS’07, pp 273–283

  19. Mitsunari S, Sakai R, Kasahara M (2002) A new traitor tracing. J IEICE Trans Fundam E85-A(2):481–484

    Google Scholar 

  20. Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Advances in cryptology—CRYPTO’84. Lecture notes in computer science, vol 0196. Springer, Berlin, pp 47–53

    Chapter  Google Scholar 

  21. Tô V, Safavi-Naini R, Zhang F (2003) New traitor tracing schemes using bilinear map. In: Proceedings of 2003 DRM workshop, pp 67–76

  22. Tso R, Okamoto T, Okamoto E (2009) Efficient short signatures from pairing. In: Proceedings of ITNG’09, pp 417–422

  23. Wu J, Stinson DR (2007) An efficient identification protocol and the knowledge-of-exponent assumption, Cryptology ePrint Archive: Report 2007/479

  24. Yap WL, Heng SH, Goi BM (2006) An efficient certificteless signature. In: Proceedings of EUC workshops’06. Lecture notes in computer science, vol 4097. Springer, Berlin, pp 322–331

    Google Scholar 

  25. Yap WL, Chow SSM, Heng SH, Goi BM (2007) Security mediated certificateless signatures. In: Proceedings of ACNS’07. Lecture notes in computer science, vol 4521. Springer, Berlin, pp 459–477

    Google Scholar 

  26. Yum DH, Lee PJ (2004) Generic construction of certificateless signature. In: Proceedings of ACISP’04. Lecture note in computer science, vol 3108. Springer, Berlin, pp 200–211

    Google Scholar 

  27. Zhang F, Chen X, Susilo W, Mu Y (2005) A new short signature scheme without random oracles from bilinear pairings. Cryptology ePrint Archive, Repost 2005/386. Available at http://eprint.iacr.org/2005/386.pdf

  28. Zhang F, Safavi-Naini R, Susilo W (2003) An efficient signature scheme from binilear pairings and its applications. In: Proceedings of PKC’04. Lecture notes in computer science, vol 3947. Springer, Berlin, pp 277–290

    Google Scholar 

  29. Zhang Z, Wong DS, Xu J, Feng D (2006) Certificateless public-key signature: security model and efficient construction. In: Proceedings of ACNS’06. Lecture notes in computer science, vol 3989. Springer, Berlin, pp 293–308

    Google Scholar 

  30. Zheng L, Zhang F, Zhang F (2007) New efficient certificateless signature scheme. In: Proceedings of EUC’07. Lecture notes in computer science, vol 4809. Springer, Berlin, pp 692–703

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raylin Tso.

Additional information

A preliminary version of the extended abstract of partial results appeared in CANS2008 (Tso et al. in Lecture Notes in Computer Science, vol. 5339, pp. 64–79, 2008).

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Tso, R., Yi, X. & Huang, X. Efficient and short certificateless signatures secure against realistic adversaries. J Supercomput 55, 173–191 (2011). https://doi.org/10.1007/s11227-010-0427-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-010-0427-x

Keywords

  • Bilinear pairing
  • Certificateless signature
  • Cryptographic protocol
  • Digital signature
  • Random oracle model
  • Short signature