Paper 2002/172
PECDSA. How to build a DL-based digital signature scheme with the best proven security
Louis Granboulan
Abstract
Many variants of the ElGamal signature scheme have been proposed. The most famous is the DSA standard. If computing discrete logarithms is hard, then some of these schemes have been proven secure in an idealized model, either the random oracle or the generic group. We propose a generic but simple presentation of signature schemes with security based on the discrete logarithm. We show how they can be proven secure in idealized model, under which conditions. We conclude that none of the previously proposed digital signature schemes has optimal properties and we propose a scheme named PECDSA.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Extended abstract submitted to an IACR conference
- Keywords
- digital signaturesdiscrete logarithm problemidealized modelproven security.
- Contact author(s)
- Louis Granboulan @ ens fr
- History
- 2002-11-13: received
- Short URL
- https://ia.cr/2002/172
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/172,
author = {Louis Granboulan},
title = {PECDSA. How to build a DL-based digital signature scheme with the best proven security},
howpublished = {Cryptology ePrint Archive, Paper 2002/172},
year = {2002},
note = {\url{https://eprint.iacr.org/2002/172}},
url = {https://eprint.iacr.org/2002/172}
}
