Paper 2008/286 Original: eprint.iacr.org/2008/286 ↗
One-Up Problem for (EC)DSA
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2008-07-03: last updated
- 2008-07-03: published
- Short URL
- https://ia.cr/2008/286
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/286,
author = {Daniel R. L. Brown},
title = {One-Up Problem for (EC)DSA},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/286},
year = {2008},
url = {https://eprint.iacr.org/2008/286}
}