期刊名称：TELKOMNIKA (Telecommunication Computing Electronics and Control)
印刷版ISSN：2302-9293
出版年度：2016
卷号：14
期号：1
页码：335-341
DOI：10.12928/telkomnika.v14i1.2919
语种：English
出版社：Universitas Ahmad Dahlan
摘要：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.
其他摘要：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.
