A new elliptic curve undeniable signature scheme
Tzer‐Shyong Chen, En-Te Hsu, Yuan-Lung Yu · International Mathematical Forum · 2006
A secure and efficient cryptosystem can be constructed through three primary methods, the discrete logarithm system (e.g. DSA), the integer factorization system (e.g. RSA), and the elliptic curve cryptosystem (ECC) [1][2]. This paper employs the elliptic curve cryptosystem method. The elliptic curve cryptosystem has low computational amount and short key size, both of which benefit a cryptosystem in limited-hardware environment with reduced overheads. The ECC provides a suitable environment for the cryptosystems. This study presents a new elliptic curve undeniable signature scheme, which is an improved design of the undeniable group signature scheme. The proposed scheme is based on the ECC. Complex parameters have been simplified to reduce time complexity. Hence, the proposed scheme is simpler than the undeniable group signature scheme yet more efficient and more secure. Key words: Undeniable signature scheme, discrete logarithm, integer factorization, elliptic curve cryptosystem, and cryptography 1.