Signature Schemes Based on the Strong RSA Assumption

Ronald Cramer, Victor Shoup

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)161-185
Number of pages25
JournalACM Transactions on Information and System Security
Volume3
Issue number3
DOIs
StatePublished - Aug 1 2000

Fingerprint

Electronic document identification systems
Hash functions

Keywords

  • Algorithms
  • digital signatures
  • provable security
  • RSA
  • Security
  • Theory

ASJC Scopus subject areas

  • Computer Science(all)
  • Safety, Risk, Reliability and Quality

Cite this

Signature Schemes Based on the Strong RSA Assumption. / Cramer, Ronald; Shoup, Victor.

In: ACM Transactions on Information and System Security, Vol. 3, No. 3, 01.08.2000, p. 161-185.

Research output: Contribution to journalArticle

@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, digital signatures, provable security, RSA, Security, Theory",
author = "Ronald Cramer and Victor Shoup",
year = "2000",
month = "8",
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 - digital signatures

KW - provable security

KW - RSA

KW - Security

KW - Theory

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

VL - 3

SP - 161

EP - 185

JO - ACM Transactions on Information and System Security

JF - ACM Transactions on Information and System Security

SN - 1094-9224

IS - 3

ER -