Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (1): 112-116.doi: 10.13190/j.jbupt.2016.01.021

• Reports • Previous Articles     Next Articles

Improved Provably Secure Certificateless Signature Scheme

TANG Yong-li, WANG Fei-fei, YE Qing, YAN Xi-xi   

  1. College of Computer Sciences and Technology, Henan Polytechnic University, Henan Jiaozuo 454000, China
  • Received:2016-02-18 Online:2016-02-28 Published:2016-01-29

Abstract:

A forgery attack on Fan Aiwan et al's certificateless signature scheme was presented. It is found that the strong type I adversary could forge any user's valid signature on any message. The reason of this problem is that the random number selected in the signature generation phase is not associated with the message M. To improve the original scheme's security, the improved schemes in which the random number selected in the signature generation phase is bound to the hash function value of message M was proposed. The scheme proposed can resist both super type Ⅰ and type Ⅱ adversary, and it only needs one scalar multiplication in signature generation phase and four scalar multiplications in signature verification phase; the other schemes proposed can resist strong type Ⅰ and super type Ⅱ adversary and are secure against the attacker in the real world. In addition, they only need one scalar multiplication in signature generation phase, and three scalar multiplications in signature verification phase. The improved schemes are provably secure under the intractability of elliptic curve discrete logarithm problem.

Key words: certificateless signature, elliptic curve discrete logarithm problem, provable security, random oracle model

CLC Number: