International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: PECDSA. How to build a DL-based digital signature scheme with the best proven security

Authors:
Louis Granboulan
Download:
URL: http://eprint.iacr.org/2002/172
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2002-11695,
  title={PECDSA. How to build a DL-based digital signature scheme with the best proven security},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / digital signatures, discrete logarithm problem, idealized model, proven security.},
  url={http://eprint.iacr.org/2002/172},
  note={Extended abstract submitted to an IACR conference Louis.Granboulan@ens.fr 12003 received 12 Nov 2002},
  author={Louis Granboulan},
  year=2002
}