Cryptology ePrint Archive: Report 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.

Category / Keywords: Signature, RSA, Strong RSA Assumption.

Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.

Date: received Jan 11th, 1999. Revised October 11, 1999.

Contact author: sho at zurich ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Short URL: ia.cr/1999/001

Discussion forum: Show discussion | Start new discussion