The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Abstract
Article Non-cryptographic fault-tolerant computing in constant number of rounds of interaction Share on Authors: J. Bar-Ilan Hebrew University Hebrew UniversityView Profile , D. Beaver Harvard University Harvard UniversityView Profile Authors Info & Claims PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computingJune 1989 Pages 201–209https://doi.org/10.1145/72981.72995Online:01 June 1989Publication History 163citation1,190DownloadsMetricsTotal Citations163Total Downloads1,190Last 12 Months94Last 6 weeks18 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
Efficient Multiparty Protocols Using Circuit Randomization
Beaver, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_34 · Cited by 893
Self-citationThe round complexity of secure protocols
Beaver, D., Micali, S., & Rogaway, P. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100287 · Cited by 721
Self-citationScalable and Unconditionally Secure Multiparty Computation
Damgård, I., & Nielsen, J. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_32 · Cited by 270
Privacy-Preserving Gradient-Descent Methods
Han, S., Ng, W. K., Wan, L., & Lee, V. C. S. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.153 · Cited by 70
Metadata
- Authors
- Bar-Ilan, J., & Beaver, D.
- Venue
- Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 201-209
- OpenAlex
- W2077315235
- Cited by
- 266
- References
- 2
- FWCI
- 2.79
- 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: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. https://app.cochat.ai/papers/10.1145/72981.72995
- The paper
- Bar-Ilan, J., & Beaver, D. (1989). Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89. https://doi.org/10.1145/72981.72995
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.
