Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)

@inproceedings{Cleve1986LimitsOT,
  title={Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)},
  author={Richard Cleve},
  booktitle={STOC},
  year={1986}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 51 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 335 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 220 extracted citations

335 Citations

02040'86'93'01'09'17
Citations per Year
Semantic Scholar estimates that this publication has 335 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…