Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 325

The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.

Signature schemes based on the strong RSA assumption

Open access
Cramer, Ronald, Shoup, Victor·2000·ACM Transactions on Information and System Security

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/357830.357847

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 25 references

Cited by

See all 325

Metadata

Authors
Cramer, R., & Shoup, V.
Venue
ACM Transactions on Information and System Security
Published
2000-08
Volume
3
Issue
3
Pages
161-185
ISSN
  • 1094-9224 (ISSN-L)
  • 1557-7406
OpenAlex
W1974232544
Cited by
325
References
25
FWCI
11.66
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Signature schemes based on the strong RSA assumption. https://app.cochat.ai/papers/10.1145/357830.357847
The paper
Cramer, R., & Shoup, V. (2000). Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security. https://doi.org/10.1145/357830.357847

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.