The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
An intensive survey of fair non-repudiation protocols
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Time-lock Puzzles and Timed-release Crypto
Rivest, R. L., Adi Shamir, Z., & Wagner, D. (1996) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 546
Advances in Cryptology: Proceedings of Crypto 84
Blakley, G. R., & Chaum, D. (1985) · Medical Entomology and Zoology · Cited by 502
Certificate revocation and certificate update
Naor, M., & Nissim, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839932 · Cited by 493
Girault, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_42 · Cited by 479
A Fair Non-repudiation Protocol
Zhou, J., & Gollmann, D. (2007) · Cited by 371
Self-citationAsynchronous protocols for optimistic fair exchange
Asokan, N., Shoup, V., & Waidner, M. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674826 · Cited by 316
Optimistic fair exchange of digital signatures: Extended abstract
Asokan, N., Shoup, V., & Waidner, M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054156 · Cited by 305
Efficient and practical fair exchange protocols with off-line TTP
Bao, F., Deng, R. H., & Mao, W. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674825 · Cited by 295
Cited by
On Security in Publish/Subscribe Services: A Survey
Esposito, C., & Ciampi, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2364616 · Cited by 55
Metadata
- Authors
- Kremer, S., Markowitch, O., & Zhou, J.
- Venue
- Computer Communications
- Publisher
- Elsevier BV
- Published
- 2002-11
- Volume
- 25
- Issue
- 17
- Pages
- 1606-1621
- ISSN
- 0140-3664 (ISSN-L)
- OpenAlex
- W1989968537
- Cited by
- 263
- References
- 25
- FWCI
- 12.38
- Type
- journal article
- 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: An intensive survey of fair non-repudiation protocols. https://app.cochat.ai/papers/10.1016/s0140-3664(02)00049-x
- The paper
- Kremer, S., Markowitch, O., & Zhou, J. (2002). An intensive survey of fair non-repudiation protocols. Computer Communications. https://doi.org/10.1016/s0140-3664(02)00049-x
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.