Journal on Communications ›› 2015, Vol. 36 ›› Issue (2): 48-55.doi: 10.11959/j.issn.1000-436x.2015033

• Academic papers • Previous Articles     Next Articles

Certificateless-based efficient aggregate signature scheme with universal designated verifier

Yu-lei ZHANG1,Dong-rui ZHOU1,Chen-yi LI1,Yong-jie ZHANG2,Cai-fen WANG1   

  1. 1 College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China
    2 Gansu Health Vocational College,Lanzhou 730000,China
  • Online:2015-02-25 Published:2017-06-27
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Higher Educational Scientific Research Foundation of Gansu Province of China;The Young Teachers’ Scientific Research Ability Promotion Program of Northwest Normal University

Abstract:

The security model of the certificateless aggregate signature scheme with universal designated verifier was studied,and then a certificateless aggregate signature scheme with universal designated verifier using bilinear pairings was proposed.In the random oracle mode,based on the hardness of the computational Diffie-Hellman problem,the new scheme was proved to be secure against three attacks of certificateless aggregate signature scheme with universal designated verifier.Meanwhile,the scheme satisfies properties of strong designated verify and non-transferability.Furthermore,the length of final aggregate signature is equivalent as the length of signal user’s signature,it is more efficient than others because the pairing computation is fixed among public verifies and designed verifies.

Key words: aggregate signature, certificateless signature, universal designated verifier, computational Diffie-Hellman problem

No Suggested Reading articles found!