A New Signature Scheme Based on Factoring and Discrete Logarithm Problems

Verma, Swati; Sharma, Birendra Kumar

doi:10.11591/ijins.v1i3.536

Cited by 4 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And we present the formal security proof for our scheme in the security model. Then, compared with the schemes in [22,23], our scheme is more secure.…”

Section: Resultsmentioning

confidence: 99%

“…In this part, we compare our scheme with the similar schemes of this kind [21,23] as Table 1. First, we make a security comparison among the similar schemes.…”

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

“…Then, compared with the scheme in [21], our scheme has a better security. The security of the scheme proposed by Verma and Sharma [23] is also based on discrete logarithm and factoring problems. However, the security of their scheme cannot be proved in the formal security model.…”

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

“…What is more, their scheme is a certificate-based one, in which the security of key management has to be considered. On the other hand, before verifying the signature in [23], the public key certificate should be transmitted to the verifier. Now, we compare the efficiency of the similar schemes.…”

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

“…Compared with the scheme proposed in [21] that its security depends on only one hard problem; our scheme has a better security. Compared with the scheme proposed in [23], our scheme is a certificateless one, which doesn't need any certificate, and it doesn't need to send any public key certificate to the verifier before verifying a signature. On the other hand, our scheme is an efficient one.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm

Xin

2016

TELKOMNIKA

View full text Add to dashboard Cite

Certificateless signature is one of the most important security primitives which can be used to solve the key escrow problem existing in ID-based signature. The security of most certificateless signatures depends only based on one mathematical hard problem. This means that once the underlying hard problem is broken, the signature will be broken, too. In this paper, a certificateless signature whose security depends on two mathematical hard problems, discrete logarithm and factoring problems, is proposed. Our scheme can be proved to be secure in the random oracle. Only both of the discrete logarithm and factoring problems are solved can our signature be broken. On the other hand, compared with the other schemes of this kind, our scheme is more efficient. Especially, in our scheme, it is very efficient to sign a signature, since there is not any exponential modular computation when the precomputation is ignored. Then, compared with the other schemes of this kind, our scheme has a better security and efficiency.

show abstract

“…And we present the formal security proof for our scheme in the security model. Then, compared with the schemes in [22,23], our scheme is more secure.…”

Section: Resultsmentioning

confidence: 99%

“…In this part, we compare our scheme with the similar schemes of this kind [21,23] as Table 1. First, we make a security comparison among the similar schemes.…”

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

Section: Efficiency and Security Comparisonmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm

Xin

2016

TELKOMNIKA

View full text Add to dashboard Cite

show abstract

A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm

Elumalai

Anjaneyulu²

2022

Symmetry

View full text Add to dashboard Cite

A symmetric cipher such as AES in cryptography is much faster than an asymmetric cipher but digital signatures often use asymmetric key ciphers because they provides the sender’s identity and data integrity. In this paper, a modified-He digital signature scheme is proposed using a one-way hash function. The proposed scheme, unlike the He signature technique, employs Euclid’s Division Lemma with large prime moduli p. Its security is built on large integer factoring, discrete logarithms and expanded root problems. The time complexity of the proposed scheme is O(log3p). The proposed modified-He scheme is efficient, as evidenced by the analytical results with key lengths greater than 512 bits.

show abstract

Digital Signature Schemes Based on Two Hard Problems

Nimbalkar¹,

Desai

2017

Detecting and Mitigating Robotic Cyber Security Risks

View full text Add to dashboard Cite

This chapter takes a critical review of the digital signature schemes which are based on two hard problems. The analytical study begins with the Harn (1994) scheme and He-Kiesler (1994) scheme. Shao's 1998 and 2002 schemes have been studied. Wei-Hua He (2001) and Shimin Wei (2004, 2007) schemes are analyzed further in the research work. Attacks on Shimin Wei's (2004, 2007) schemes are critically studied and drawbacks have been noted so as to design better schemes than these. Then we continue our analysis work by studying Ismail, Thate, and Ahmad's (2008) scheme and Swati Verma's (2012) signature scheme.

show abstract

A New Signature Scheme Based on Factoring and Discrete Logarithm Problems

Cited by 4 publications

References 9 publications

Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm

Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm

A Modified Wei-Hua-He Digital Signature Scheme Based on Factoring and Discrete Logarithm

Digital Signature Schemes Based on Two Hard Problems

Contact Info

Product

Resources

About