Signature schemes based on the strong RSA assumption

  • Authors:
  • Ronald Cramer;Victor Shoup

  • Affiliations:
  • Aarhus Univ., Aarhus, Denmark;IBM Zurich Research Lab, Zurich, Switzerland

  • Venue:
  • ACM Transactions on Information and System Security (TISSEC)
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called strong RSA assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption.