Cryptology ePrint Archive: Report 2002/172
PECDSA. How to build a DL-based digital signature scheme with the best proven security
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.
Category / Keywords: public-key cryptography / digital signatures, discrete logarithm problem, idealized model, proven security.
Publication Info: Extended abstract submitted to an IACR conference
Date: received 12 Nov 2002
Contact author: Louis Granboulan at ens fr
Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Version: 20021113:192945 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]