To make users put much confidence in digital signatures, this paper proposes the first provably secure signature scheme based on both factoring and discrete logarithms. The new scheme incorporates both the Schnorr signature scheme and the PSS-Rabin signature scheme. Unless both the two cryptographic assumptions could be become solved simultaneously, anyone would not forge any signature. The proposed scheme is efficient since the computation requirement and the storage requirement are slightly larger than those for the Schnorr signature scheme and the PSS-Rabin signature scheme.
Digital Object Identifier (DOI)
Shao, Zuhua and Gao, Yipeng
"A Provably Secure Signature Scheme based on Factoring and Discrete Logarithms,"
Applied Mathematics & Information Sciences: Vol. 08:
4, Article 8.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol08/iss4/8