A Signature Scheme with Message Recovery as Secure as Discrete Logarithm

  title={A Signature Scheme with Message Recovery as Secure as Discrete Logarithm},
  author={M. Abe and T. Okamoto},
  • 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
    58 Citations

    Topics from this paper

    Signature Scheme with Arbitrary Length Message Recovery in CPK
    • 2
    A novel identity-based signature with message recovery from RSA
    • X. Wang, H. Qian
    • Mathematics, Computer Science
    • Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology
    • 2011
    • 2
    Efficient Identity-based Signature Scheme with Partial Message Recovery
    • Yong Li, Huiyan Chen
    • Computer Science
    • Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
    • 2007
    • 4
    Lattice-based message recovery signature schemes
    • 2
    • Highly Influenced
    PECDSA. How to build a DL-based digital signature scheme with the best proven security
    • 5
    • PDF


    Security Proofs for Signature Schemes
    • 998
    • PDF
    The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin
    • 984
    • Highly Influential
    • PDF
    On Concrete Security Treatment of Signatures Derived from Identification
    • 125
    • PDF
    A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves
    • A. Miyaji
    • Mathematics, Computer Science
    • 1996
    • 30
    • Highly Influential
    • PDF
    A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
    • 2,768
    • PDF
    Universal one-way hash functions and their cryptographic applications
    • 991
    • PDF
    Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1
    • 621
    • PDF
    On the Security of RSA Padding
    • 91
    • PDF