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={Masayuki Abe and Tatsuaki Okamoto},
  booktitle={ASIACRYPT},
  year={1999}
}
SUMMARY This paper, for the first time, presents a signature scheme with message recovery based on the elliptic-curve discrete logarithm. The proposed scheme is proven to be secure in the strongest sense (i.e., existentially unforgeable against adaptively chosen message attacks) in the random oracle model under the discrete logarithm assumption. We give a concrete analysis of the security reduction. When practical hash functions are used in place of truly random functions, the proposed scheme… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 33 CITATIONS

A Provably Secure Short Signature Scheme from Coding Theory

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures)

  • Financial Cryptography
  • 2005
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Practical Identity-Based Signature Scheme from Bilinear Map

  • EUC Workshops
  • 2007
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Identity-based signatures in standard model

  • Acta Informatica
  • 2018
VIEW 1 EXCERPT
CITES METHODS

On the Incremental Digital Signatures

  • 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)
  • 2018
VIEW 1 EXCERPT

An effective efficiency analysis of Random Key Cryptography over RSA

  • 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom)
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Rueppel, “A new signature scheme based on the DSA giving message recovery,

R.A.K. Nyberg
  • Proc. First ACM Conference on Computer and Communications Security,
  • 1993
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

A signature scheme with message recovery as secure as discrete logarithm,

M. Abe, T. Okamoto
  • Proc. Asiacrypt’99, LNCS 1716,
  • 1999
VIEW 1 EXCERPT

On the security of RSA padding,

D. Naccache, J. P. Stern
  • Proc. Crypto’99,
  • 1999
VIEW 1 EXCERPT