Journal on Communications ›› 2015, Vol. 36 ›› Issue (4): 186-194.doi: 10.11959/j.issn.1000-436x.2015098

• Academic communication • Previous Articles    

Certificateless signature scheme without random oracles

Yan-qiong LI,Ji-guo LI,Yi-chen ZHANG   

  1. College of Computer & Information,Hohai University,Nanjing 211100,China
  • Online:2015-04-25 Published:2015-04-15
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Six Talent Peaks Program of Jiangsu Province;The Six Talent Peaks Program of Jiangsu Province

Abstract:

The security of certificateless signature schemes can be proved under the random oracle model.However,any implementation of the random oracle may result in insecure schemes.Some certificateless signature schemes without random oracles are not secure against key replacement attack.In order to solve this problem,a new certificateless signature scheme in the standard model had constructed.Based on the NGBDH and Many-DH assumption,the scheme was proved secure against existentially unforgeable under adaptive chosen message attack.In addition,the proposed scheme enjoys less computation cost and lower communication bandwidth and can resist against key replacement attack.

Key words: certificateless signature, standard model, NGBDH problem, Many-DH problem

No Suggested Reading articles found!