Enhanced short signature scheme with hybrid problems

On the security of an enhanced signature scheme

“…Recently, Su [6] presented an enhanced short signature scheme and claimed that it is secure in the random oracle model. In this paper, however, we have demonstrated that an adversary can forge a signature on any message with respect to any identity.…”

“…4 Security analysis on Su's signature scheme Su [6] claimed that his signature scheme is secure in the random oracle model. However, he didn't give a formal proof of the scheme.…”

“…However, most of the existing short signature schemes are only based on one intractable assumption, such as bilinear pairing [2,3,4] and RSA [5]. Recently, to enhance the security of short signatures, Su [6] presented an ID-based short signature scheme based on knapsack and bilinear pairing. He claimed that his scheme is provably secure in the random oracle model.…”

Improvement of signature scheme based on the hybrid of two problems

“…Hence the need of schemes that uses multiples number problems as its security. Following that, signature schemes based on multiple number problems begin to be developed such as schemes that combined factorization and discrete logarithm problems [7] and scheme that are based on knapsack and Gap Diffie-Hellman [8]. Although these schemes might take a longer computation time, it will be more secure than schemes based on a singular problem.…”

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

“…In 2007, Yu-Fang Chung et al [10] suggested a technique depending on the difficulty of solving the ECDLP. In 2011, Pin-Chang Su [11] introduced the enhanced short signature method, which is based on knapsack and Gap Diffie-Hellman (GDH) groups and whose security is strongly connected to the discrete logarithm assumption. The authors of the papers [12][13][14] outlined a new digital signature scheme based on two difficult problems.…”