The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Open accessOverview
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.
Integrity signals
Registry
Cites
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.
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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Research works printed but not linked: 16
- D. Balenson, “Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers,” IETF RFC 1423, February 1993. · DOI
- M. Bellare and S. Micali, “How to sign given any trapdoor permutation,” JACM Vol. 39, No. 1, 214–233, January 1992. · DOI
- M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993. · DOI · Paper page
- M. Bbellare and P. Rogaway, “Optimal Asymmetric Encryption,” Advances in Cryptology — Eurocrypt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
- W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Info. Theory IT-22, 644–654, November 1976. · DOI · Paper page
- C. Dwork and M. Naor. An efficient existentially unforgeable signature scheme and its applications. Advances in Cryptology — Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
- A. Fiat and A. Shamir, “How to prove yourself: practical solutions to identification and signature problems,” Advances in Cryptology — Crypto 86 Proceedings, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
- S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal of Computing, 17(2):281–308, April 1988. · DOI · Paper page
- M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications,” Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989. · DOI · Paper page
- A. Lenstra and H. Lenstra (eds.), “The development of the number field sieve,” Lecture Notes in Mathematics, vol 1554, Springer-Verlag, 1993. · DOI · Paper page
- D. Pointcheval and J. Stern, “Security proofs for signatures,” Advances in cryptology — Eurocrypt 96 Proceedings, Lecture Notes in Computer Science, U. Maurer ed., Springer-Verlag, 1996.
- R. Rivest, “The MD5 Message-Digest Algorithm,” IETF RFC 1321, April 1992. · DOI · Paper page
- R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” CACM 21 (1978). · DOI · Paper page
- M. Rabin, “Digital signatures,” in Foundations of secure computation, R. A. Millo et. al. eds, Academic Press, 1978.
- J. Rompel, “One-Way Functions are Necessary and Sufficient for Secure Signatures,” Proceedings of the 22nd Annual Symposium on Theory of Computing, ACM, 1990. · DOI · Paper page
- H. Williams, “A modification of the RSA public key encryption procedure,” IEEE Transactions on Information Theory, Vol. IT-26, No. 6, November 1980. · DOI · Paper page
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
Metadata
- Authors
- Bellare, M., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 399-416
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2162653919
- Cited by
- 945
- References
- 1
- FWCI
- 15.10
- Type
- conference paper
- 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: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin. https://app.cochat.ai/papers/10.1007/3-540-68339-9_34
- The paper
- Bellare, M., & Rogaway, P. (1996). The Exact Security of Digital Signatures-How to Sign with RSA and Rabin. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-68339-9_34
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.
