The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Incremental Cryptography: The Case of Hashing and Signing
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.
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
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Self-citationThe MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Self-citationThe MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_22 · Cited by 1,381
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Self-citationUniversal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A survey on security issues in service delivery models of cloud computing
Subashini, S., & Kavitha, V. (2011) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2010.07.006 · Cited by 2,625
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30556-9_27 · Cited by 522
Johnson, R., Molnar, D., Song, D., & Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45760-7_17 · Cited by 501
Metadata
- Authors
- Bellare, M., Goldreich, O., & Goldwasser, S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-09
- Pages
- 216-233
- OpenAlex
- W1582713334
- Cited by
- 312
- References
- 18
- FWCI
- 11.28
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Incremental Cryptography: The Case of Hashing and Signing. https://app.cochat.ai/papers/10.1007/3-540-48658-5_22
- The paper
- Bellare, M., Goldreich, O., & Goldwasser, S. (2007). Incremental Cryptography: The Case of Hashing and Signing. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-48658-5_22
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.
