Signature Schemes Based on the Strong RSA Assumption

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.

• Type: Conference
• Year: 1999
• Where: CCS
• Authors: Ronald Cramer, Victor Shoup
• Keywords: CCS 1999, Reasonable Intractability Assumption, RSA Assumption, Security Privacy, Strong Rsa Assumption