The DOI matches its Crossref record.
Asynchronous secure computations with optimal resilience (extended abstract)
Open accessAbstract
We investigate the problem of multiparty computations in a fully connected, asynchronous network of n players, in which up to t Byzantine faults may occur.
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
Cited by
The Honey Badger of BFT Protocols
Miller, A., Xia, Y., Croman, K., Shi, E., & Song, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978399 · Cited by 810
Sharemind: A Framework for Fast Privacy-Preserving Computations
Bogdanov, D., Laur, S., & Willemson, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88313-5_13 · Cited by 690
Dumbo: Faster Asynchronous BFT Protocols
Guo, B., Lu, Z., Tang, Q., Xu, J., & Zhang, Z. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417262 · Cited by 278
Wang, G., Shi, Z. J., Nixon, M., & Han, S. (2019) · Proceedings of the 1st ACM Conference on Advances in Financial Technologies · doi:10.1145/3318041.3355457 · Cited by 270
A Survey of Blockchain Consensus Protocols
Xu, J., Wang, C., & Jia, X. (2023) · ACM Computing Surveys · doi:10.1145/3579845 · Cited by 263
Metadata
- Authors
- Ben-Or, M., Kelmer, B., & Rabin, T.
- Venue
- Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
- Publisher
- ACM Press
- Published
- 1994
- Pages
- 183-192
- OpenAlex
- W2025142762
- Cited by
- 195
- References
- 0
- FWCI
- 0.42
- Type
- conference paper
- Language
- en
- Open access
- gold
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 secure computations with optimal resilience (extended abstract). https://app.cochat.ai/papers/10.1145/197917.198088
- The paper
- Ben-Or, M., Kelmer, B., & Rabin, T. (1994). Asynchronous secure computations with optimal resilience (extended abstract). Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94. https://doi.org/10.1145/197917.198088
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.