A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Design Validations for Discrete Logarithm Based Signature Schemes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A "Paradoxical" Solution To The Signature Problem
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Hi-index | 0.00 |
We describe two variants of ECDSA one of which is secure, in the random oracle model, against existential forgery but suffers from the notion of duplicate signatures. The second variant is also secure against existential forgery but we argue that it is likely to possess only four natural duplicate signatures. Our variants of ECDSA are analogous to the variants of DSA as proposed by Brickell et al. However, we show that the ECDSA variants have better exact security properties.