Efficient certificate-based signature scheme without pairings
Dake He · Jisuanji yingyong yanjiu · 2013
There are pairing operations in most current certificate-based signature schemes,so the efficiencies of those schemes are low.It is necessary to research certificate-based signature schemes with higher security and higher efficiency.Based on discrete logarithm problem and the forking lemma,this paper presented a certificate-based signature scheme without pairings,which efficiency had been analyzed,and it proved security under the random oracle model.Analysis show that the scheme is existentially unforgeable against user attack and CA attack,against public key replacing attack.Because of its efficiency,it can be used in the computation power and bandwidth limited environment.