Signature schemes based on the strong RSA assumption

Ronald Cramer; Victor Shoup

Signature schemes based on the strong RSA assumption

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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)

Cite this

@inproceedings{cf5ff81e9f45438694af825f80924fd9,

title = "Signature schemes based on the strong RSA assumption",

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.",

author = "Ronald Cramer and Victor Shoup",

year = "1999",

language = "English (US)",

pages = "46--51",

booktitle = "Proceedings of the ACM Conference on Computer and Communications Security",

publisher = "ACM",

note = "Proceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS) ; Conference date: 02-11-1999 Through 04-11-1999",

}

TY - GEN

T1 - Signature schemes based on the strong RSA assumption

AU - Cramer, Ronald

AU - Shoup, Victor

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033280013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033280013&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0033280013

SP - 46

EP - 51

BT - Proceedings of the ACM Conference on Computer and Communications Security

PB - ACM

T2 - Proceedings of the 1999 6th ACM Conference on Computer and Communications Security (ACM CCS)

Y2 - 2 November 1999 through 4 November 1999

ER -

Signature schemes based on the strong RSA assumption

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this