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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the ACM Conference on Computer and Communications Security |
| Publisher | ACM |
| Pages | 46-51 |
| Number of pages | 6 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS) - Singapore, Singapore Duration: Nov 2 1999 → Nov 4 1999 |
Other
| Other | Proceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS) |
|---|---|
| City | Singapore, Singapore |
| Period | 11/2/99 → 11/4/99 |
ASJC Scopus subject areas
- Computer Science(all)
Fingerprint Dive into the research topics of 'Signature schemes based on the strong RSA assumption'. Together they form a unique fingerprint.
Cite this
Cramer, R., & Shoup, V. (1999). Signature schemes based on the strong RSA assumption. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 46-51). ACM.