Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer; Victor Shoup

Paper 1999/001

Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer and Victor Shoup

Abstract

We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the 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.

Metadata

Available format(s): PS
Publication info: Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Keywords: Signature RSA Strong RSA Assumption.
Contact author(s): sho @ zurich ibm com
History: 1999-10-11: revised; 1999-01-11: received
Short URL: https://ia.cr/1999/001
License: CC BY

BibTeX

@misc{cryptoeprint:1999/001,
      author = {Ronald Cramer and Victor Shoup},
      title = {Signature Schemes Based on the Strong RSA Assumption},
      howpublished = {Cryptology ePrint Archive, Paper 1999/001},
      year = {1999},
      note = {\url{https://eprint.iacr.org/1999/001}},
      url = {https://eprint.iacr.org/1999/001}
}