The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Asynchronous protocols for optimistic fair exchange
Abstract
The optimistic approach of involving a third party only in the case of exceptions is a useful technique to build secure, yet practical fair exchange protocols. Previous solutions using this approach implicitly assumed that players had reliable communication channels to the third party. We present a set of optimistic fair exchange protocols which tolerate temporary failures in the communication channels to the third party. A central feature of the protocols is that either player can asynchronously and unilaterally bring a protocol run to completion.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Cited by
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
Self-citationThe Modelling and Analysis of Security Protocols: the CSP Approach
Ryan, P. Y. A., Schneider, S. A., Goldsmith, M., Lowe, G., & Roscoe, A. (2001) · doi:10.25405/ncl.34123404 · Cited by 269
Metadata
- Authors
- Asokan, N., Shoup, V., & Waidner, M.
- Venue
- Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-27
- Pages
- 86-99
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1752677809
- Cited by
- 316
- References
- 1
- FWCI
- 23.92
- 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: Asynchronous protocols for optimistic fair exchange. https://app.cochat.ai/papers/10.1109/secpri.1998.674826
- The paper
- Asokan, N., Shoup, V., & Waidner, M. (2002). Asynchronous protocols for optimistic fair exchange. Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186). https://doi.org/10.1109/secpri.1998.674826
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.
