Journal on Communications ›› 2014, Vol. 35 ›› Issue (11): 126-131.doi: 10.11959/j.issn.1000-436x.2014.11.014

• security protocol • Previous Articles     Next Articles

Provably secure and efficient certificateless sequential multi-signature scheme in random oracle model

Yan XU1,2,Liu-sheng HUANG1,Miao-miao TIAN1,Hong ZHONG3   

  1. 1 School of Computer Science and Technology,University of Science and Technology of China,Hefei 230026,China
    2 Modern Educational and Technology Center,Anhui University,Hefei 230601,China
    3 School of Computer Science and Technology,Anhui University,Hefei 230601,China
  • Online:2014-11-25 Published:2017-06-20
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fundamental Research Funds for the Central Universities;The Special Foundation for Young Scientists of Anhui Province;The Educational Commission of Anhui Province

Abstract:

Certificate less sequential multi-signature scheme could resolve the problem of authentication of recommendation information transmitted through trust train.Qin yan-lin,et al proposed an efficient certificateless sequential multi-signature scheme,and proved the security is based on the fact that computational Diffie-Hellman problem is hard in the random oracle.It is found that Qin's scheme is insecure against the forgery attack after analysing the security proof.If an adversary has obtained the signers’ multi-signature,it can forgery the multi-signature for any other message.Then,a more efficient certificateless sequential multi-signature scheme is construced which has lower computation cost and communication cost for using less bilinear pairings and only generating one signature message.Finally,the security proof shows that the proposed scheme can resist the forgery attack under the model of random oracle.

Key words: certificateless, multi-signature, security analysis, forgery attack

No Suggested Reading articles found!