The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Limits on the security of coin flips when half the processors are faulty
Abstract
Protocols which allow an asynchronous network of processors to agree on a r andom (unbiased) bit are proposed in [1] and [4]. It is claimed tha t (assuming a t rapdoor funct ion exists), if less than half of the processors are faulty then the correct processors will still agree on a bit whose bias is negligibly small (when the running t ime of the processors is poly(n) the bias is smaller than O(~r) for all k). If half the processors are faulty then these protocols are no longer effective: the bits ou tpu t by the correct processors may be heavily biased. We prove tha t the above protocols are opt imal in the sense tha t no protocol exists which tolerates faults in at least half of the processors. The result is very general because few restr ict ions are made on the types of communicat ion allowed between correct processors (such as pr ivate channels and global channels) and the correct processors only need to agree on a bit in a weak probabil ist ic sense. Also, the faulty processors do not require very much power. They can privately communicate wi th each other but they cannot read messages which are exchanged pr ivately between two correct processors. An interest ing instance of the problem arises when the number of processors is fixed at two and one of t hem
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
Coin flipping by telephone a protocol for solving impossible problems
Blum, M. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008911 · Cited by 518
Cited by
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227
Secure Multiparty Computation for Privacy-Preserving Data Mining
Lindell, Y., & Pinkas, B. (2009) · Journal of Privacy and Confidentiality · doi:10.29012/jpc.v1i1.566 · Cited by 554
How to Simulate It – A Tutorial on the Simulation Proof Technique
Lindell, Y. (2017) · Information Security and Cryptography · doi:10.1007/978-3-319-57048-8_6 · Cited by 381
Fair Computation of General Functions in Presence of Immoral Majority
Goldwasser, S., & Levin, L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_6 · Cited by 353
Secure Multiparty Computations on Bitcoin
Andrychowicz, M., Dziembowski, S., Malinowski, D., & Mazurek, L. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.35 · Cited by 345
Metadata
- Authors
- Cleve, R.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 364-369
- OpenAlex
- W2039275540
- Cited by
- 451
- References
- 1
- FWCI
- 0.58
- 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: Limits on the security of coin flips when half the processors are faulty. https://app.cochat.ai/papers/10.1145/12130.12168
- The paper
- Cleve, R. (1986). Limits on the security of coin flips when half the processors are faulty. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12168
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.