Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer and Victor Shoup

5th ACM Conference on Computer and Communications Security — CCS '99, ACM, pp. 46–51, Nov 1999.

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.

BibTeX Citation

@inproceedings{CraSho99,
    author       = {Ronald Cramer and Victor Shoup},
    title        = {Signature Schemes Based on the Strong {RSA} Assumption},
    booktitle    = {5th {ACM} Conference on Computer and Communications Security --- CCS~'99},
    pages        = {46--51},
    year         = {1999},
    month        = {11},
    publisher    = {ACM},
}