Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer; Victor Shoup

doi:10.1145/357830.357847

Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer, Victor Shoup

Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	English (US)
Pages (from-to)	161-185
Number of pages	25
Journal	ACM Transactions on Information and System Security
Volume	3
Issue number	3
DOIs	https://doi.org/10.1145/357830.357847
State	Published - Aug 1 2000

Keywords

Algorithms
RSA
Security
Theory
digital signatures
provable security

ASJC Scopus subject areas

General Computer Science
Safety, Risk, Reliability and Quality

Access to Document

10.1145/357830.357847

Cite this

@article{7e46e79d713b406e96ede050034cd864,

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

keywords = "Algorithms, RSA, Security, Theory, digital signatures, provable security",

author = "Ronald Cramer and Victor Shoup",

year = "2000",

month = aug,

day = "1",

doi = "10.1145/357830.357847",

language = "English (US)",

volume = "3",

pages = "161--185",

journal = "ACM Transactions on Information and System Security",

issn = "1094-9224",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Signature Schemes Based on the Strong RSA Assumption

AU - Cramer, Ronald

AU - Shoup, Victor

PY - 2000/8/1

Y1 - 2000/8/1

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

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

KW - Algorithms

KW - RSA

KW - Security

KW - Theory

KW - digital signatures

KW - provable security

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

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

U2 - 10.1145/357830.357847

DO - 10.1145/357830.357847

M3 - Article

AN - SCOPUS:85024261619

SN - 1094-9224

VL - 3

SP - 161

EP - 185

JO - ACM Transactions on Information and System Security

JF - ACM Transactions on Information and System Security

IS - 3

ER -

Signature Schemes Based on the Strong RSA Assumption

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this