Signature Schemes Based on Two Hard Problems Simultaneously

In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm. That is, his scheme cannot be broken unless both of the above two problems can be solved simultaneously. Later, Lee and Hwang showed that an attacker could generate a forged signature on the assumption when the discrete logarithm is solved. Recently, Shao proposed another two signature schemes, which the security rests on the two problems. In this paper, we proposed two improved signature schemes that are really based on two hard problems simultaneously. In addition, the numbers of parameters and computations will be reduced comparing to those of Shao's.

• Type: Conference
• Year: 2003
• Where: AINA
• Authors: Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
• Keywords: AINA 2003, Computer Networks, Discrete Logarithm, ElGamal's Scheme, Signature Schemes