Skip to main content
Log in

An efficient certificateless aggregate signature scheme

  • Cryptology
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. AI-Riyami S, Paterson K. Certificateless public key cryptography [C] //ASIACRYPT’03, LNCS 2894. Heidelberg: Springer-Verlag, 2003: 452–473.

    Google Scholar 

  2. Boneh D, Gentry C, Shacham H, et al. Aggregate and verifiably encrypted signatures from bilinear maps [C] //EUROCRPYT’03, LNCS 2656. Heidelberg: Springer-Verlag, 2003: 416–432.

    Google Scholar 

  3. Cheng X, Liu J, Wang X. Identity-based aggregate and verifiably encrypted signatures from bilinear pairing [C] // ICCSA’05, LNCS 3483. Heidelberg: Springer-Verlag, 2005: 1046–1054.

    Google Scholar 

  4. Gentry C, Ramzan Z. Identity-based aggregate signature [C] // PKC’06, LNCS3958. Heidelberg: Springer-Verlag, 2006: 257–273.

    Google Scholar 

  5. Lu S, Ostrovsky R, Sahai A, et al. Sequential aggregate signatures and multisignatures without random oracles [C] // EUROCRPYT’06, LNCS 4004. Heidelberg: Springer-Verlag, 2006:465–485.

    Google Scholar 

  6. Ruckert M, Schrode D. Aggregate and verifiably encrypted signatures from multilinear maps without random oracles [C] // ISA’09, LNCS 5576. Heidelberg: Springer-Verlag, 2009: 750–759.

    Google Scholar 

  7. Shao Z. Enhanced aggregate signature from pairings [C] // CISC’05, LNCS 3822. Heidelberg: Springer-Verlag, 2005: 140–149.

    Google Scholar 

  8. Shim K. An Id-based aggregate signature scheme with constant pairing computations [J]. The Journal of System and Software, 2010, 83: 1873–1880.

    Article  Google Scholar 

  9. Kang B Y. ID-based aggregate signature scheme with constant pairing computations: attack and new construction [J]. Journal of Computational Information Systems, 2012, 16: 6611–6618.

    Google Scholar 

  10. Gong Z, Long Y, Hong X, et al. Two certificateless aggregate signatures from bilinear maps [C] // Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS 2007. Washington D C: IEEE Press, 2007: 188–193.

    Chapter  Google Scholar 

  11. Xiong H, Guan Z, Chen Z, et al. An efficient certificateless aggregate signature with constant pairing computations [J]. Information Sciences, 2013, 10: 225–235.

    Article  Google Scholar 

  12. Yanai N, Tso R, Mambo M, et al. Certificateless ordered sequential aggregate signature scheme [C] // Third International Conference on Intelligent Networking and Collaborative Systems, INCos 2011. Washington D C: IEEE Press, 2011: 662–667.

    Chapter  Google Scholar 

  13. Zhang L, Zhang F. A new certificateless aggregate signature scheme [J]. Computer Communication, 2009, 32: 1079–1085.

    Article  Google Scholar 

  14. Cheng L, Wen Q, Jin Z, et al. Cryptanalysis and improvement mof a certificateless aggregate signature scheme [J]. Information Sciences, 2015, 295: 337–346.

    Article  Google Scholar 

  15. Zhang F, Shen L, Wu G. Notes on the security of certificateless aggregate signature schemes [J]. Information Sciences, 2014, 287: 32–37.

    Article  Google Scholar 

  16. Horng S, Tzeng S, Huang P, et al. An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks [J]. Information Sciences, 2015, 317: 48–66.

    Article  Google Scholar 

  17. Du H, Huang M, Wen Q. Efficient and provably-secure certificateless aggregate signature scheme [J]. Acta Electronica Sinica, 2013, 41(1): 72–76.

    Google Scholar 

  18. Chen H, Wei S, Zhu C, et al. Secure certificateless aggregate signature scheme [J]. Journal of Software, 2015, 26(5): 1173–1180.

    Google Scholar 

  19. Kang B Y, Xu D. A Secure certificateless aggregate signature scheme [J]. International Journal of Security and Its Applications, 2016, 10(3): 55–68.

    Article  Google Scholar 

  20. He D, Tian M. A note on an efficient certificateless aggregate signature with constant pairing computations [EB/OL].[2012-08-05]. http: //eprint.iacr.org/2012/445.

  21. Kang B Y. On the security of some aggregate signature schemes [J]. Journal of Applied Mathematics, 2012, Article ID 416137, DOI:10.1155/2012/416137.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Baoyuan Kang.

Additional information

Foundation item: Supported by the Applied Basic and Advanced Technology Research Programs of Tianjin (15JCYBJC15900)

Biography: KANG Baoyuan, male, Professor, research direction: information security.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kang, B., Wang, M. & Jing, D. An efficient certificateless aggregate signature scheme. Wuhan Univ. J. Nat. Sci. 22, 165–170 (2017). https://doi.org/10.1007/s11859-017-1230-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-017-1230-9

Key words

CLC number

Navigation