• DOI:10.1007/978-3-540-48000-6_30
Corpus ID: 18640983

A Signature Scheme with Message Recovery as Secure as Discrete Logarithm

@inproceedings{Abe1999ASS,
  title={A Signature Scheme with Message Recovery as Secure as Discrete Logarithm},
  author={M. Abe and T. Okamoto},
  booktitle={ASIACRYPT},
  year={1999}
}

M. Abe, T. Okamoto

Published in ASIACRYPT 1999

Computer Science, Mathematics

This paper, for the first time, presents a provably secure signature scheme with message recovery based on the (elliptic-curve) discrete logarithm. The proposed scheme can be proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the (elliptic-curve) discrete logarithm assumption. We give the concrete analysis of the security reduction. When practical hash functions are used in place of truly random… CONTINUE READING

View via Publisher

link.springer.com

Save to Library

Create Alert

Cite

Launch Research Feed