Skip to main content
Top

1999 | OriginalPaper | Chapter

A Signature Scheme with Message Recovery as Secure as Discrete Logarithm

Authors : Masayuki Abe, Tatsuaki Okamoto

Published in: Advances in Cryptology - ASIACRYPT’99

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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 functions, the proposed scheme is almost as efficient as the (elliptic-curve) Schnorr signature scheme and the existing schemes with message recovery such as (elliptic-curve) Nyberg-Rueppel and Miyaji schemes.

Metadata
Title
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm
Authors
Masayuki Abe
Tatsuaki Okamoto
Copyright Year
1999
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-540-48000-6_30

Premium Partner