## CryptoDB

### Paper: Generic Groups, Collision Resistance, and ECDSA

Authors: Daniel R. L. Brown URL: http://eprint.iacr.org/2002/026 Search ePrint Search Google Proved here is the sufficiency of certain conditions to ensure the Elliptic Curve Digital Signature Algorithm (ECDSA) existentially unforgeable by adaptive chosen-message attacks. The sufficient conditions include (i) a uniformity property and collision-resistance for the underlying hash function, (ii) pseudo-randomness in the private key space for the ephemeral private key generator, (iii) generic treatment of the underlying group, and (iv) a further condition on how the ephemeral public keys are mapped into the private key space. For completeness, a brief survey of necessary security conditions is also given. Some of the necessary conditions are weaker than the corresponding sufficient conditions used in the security proofs here, but others are identical. Despite the similarity between DSA and ECDSA, the main result is not appropriate for DSA, because the fourth condition above seems to fail for DSA. (The corresponding necessary condition is plausible for DSA, but is not proved here nor is the security of DSA proved assuming this weaker condition.) Brickell et al., Jakobsson et al. and Pointcheval et al. only consider signature schemes that include the ephemeral public key in the hash input, which ECDSA does not do, and moreover, assume a condition on the hash function stronger than the first condition above. This work seems to be the first advance in the provable security of ECDSA.
##### BibTeX
@misc{eprint-2002-11550,
title={Generic Groups, Collision Resistance, and ECDSA},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / ECDSA, provable security, hash function},
url={http://eprint.iacr.org/2002/026},
note={ dbrown@certicom.com 11745 received 27 Feb 2002},
author={Daniel R. L. Brown},
year=2002
}