CryptoDB
Signature Schemes Based on the Strong RSA Assumption
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-1999-11323, title={Signature Schemes Based on the Strong RSA Assumption}, booktitle={IACR Eprint archive}, keywords={Signature, RSA, Strong RSA Assumption.}, url={http://eprint.iacr.org/1999/001}, note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. sho@zurich.ibm.com 10500 received Jan 11th, 1999. Revised October 11, 1999.}, author={Ronald Cramer and Victor Shoup}, year=1999 }