Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm
Xiangjun Xin,Chaoyang Li +1 more
Reads0
Chats0
TLDR
This paper proposes a certificateless signature whose security depends on two mathematical hard problems, discrete logarithm and factoring problems, and can be proved secure in the random oracle, and only both of the two mathematicalhard problems are solved, can the proposed signature be broken.Abstract:
Certificateless signature can effectively immue the key escrow problem in the identity-based signature scheme. But the security of the most certificateless signatures usually depends on only one mathematical hard problem, which makes the signature vulnerable when the underlying hard problem has been broken. In order to strengthen the security, in this paper, a certificateless signature whose security depends on two mathematical hard problems, discrete logarithm and factoring problems, is proposed. Then, the proposed certificateless signature can be proved secure in the random oracle, and only both of the two mathematical hard problems are solved, can the proposed signature be broken. As a consequence, the proposed certificateless signature is more secure than the previous signatures. On the other hand, with the pre-computation of the exponential modular computation, it will save more time in the signature signing phase. And compared with the other schemes of this kind, the proposed scheme is more efficient.read more
Citations
More filters
Journal Article
Key replacement attack against a generic construction of certificateless signature
TL;DR: This paper shows that the generic construction of digital signature schemes under the framework of certificateless cryptography is insecure against key replacement attack, and proposes a modification of their scheme and shows its security in a new and simplified security model.
Journal ArticleDOI
A Lightweight Certificateless Aggregation Signature Scheme With Provably Security in the Standard Model
TL;DR: Under the hypothesis that it is hard to solve a computation Diffie–Hellman problem, two schemes are proved to be secure in the standard model and a new CLAS scheme is proposed, which is more efficient than previous CLAS schemes.
References
More filters
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Book ChapterDOI
Identity-based cryptosystems and signature schemes
TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Journal ArticleDOI
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval,Jacques Stern +1 more
TL;DR: It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.
Book ChapterDOI
Certificateless Public Key Cryptography
TL;DR: In this article, the concept of certificateless public key cryptography (CL-PKC) was introduced and made concrete, which does not require certificates to guarantee the authenticity of public keys.
Journal Article
Certificateless public key cryptography
TL;DR: In this article, the concept of certificateless public key cryptography (CL-PKC) was introduced and made concrete, which does not require certificates to guarantee the authenticity of public keys.