Certificateless signature scheme based on Rabin algorithm and discrete logarithm
Abstract: Many certificateless
signature schemes have been proposed to solve the key escrow problem in the
ID-based signatures. In this paper, based on discrete logarithm problem and
factoring problem, a new certificateless signature scheme is proposed. In our
scheme, during the signing phase, it needs not any pairing operation or
exponential modular computation. During the verifying phase, it needs two
exponential modular operations. Then, compared with the scheme of this kind,
our scheme is more efficient. Our scheme can be proved secure in the random
oracle. Only both of the factoring problem and discrete logarithm are solved
can our signature be forged. Then, compared with the scheme of this kind, our
scheme has a stronger security.
Author: Xiangjun Xin, Chaoyang
Li
Journal Code: jptkomputergg160239
