CryptoDB
One-Up Problem for (EC)DSA
Authors: | |
---|---|
Download: | |
Abstract: | The one-up problem is defined for any group and a function from the group to integers. An instance of problem consists of two points in the group. A solution consists of another point satisfying an equation involving the group and the function. The one-up problem must be hard for the security of (EC)DSA. Heuristic arguments are given for the independence of the discrete log and one-up problems. DSA and ECDSA are conjectured to be secure if the discrete log and one-up problems are hard and the hash is collision resistant. |
BibTeX
@misc{eprint-2008-17963, title={One-Up Problem for (EC)DSA}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / DSA, ECDSA}, url={http://eprint.iacr.org/2008/286}, note={ dbrown@certicom.com 14055 received 25 Jun 2008}, author={Daniel R. L. Brown}, year=2008 }