An O(log n) expected rounds randomized byzantine generals protocol

@article{Bracha1987AnON,
  title={An O(log n) expected rounds randomized byzantine generals protocol},
  author={Gabriel Bracha},
  journal={J. ACM},
  year={1987},
  volume={34},
  pages={910-920}
}
Byzantine Generals protocols enable processes to broadcast messages reliably in the presence of faulty processes. These protocols are run in a system that consists of <italic>n</italic> processes, <italic>t</italic> of which are faulty. The protocols are conducted in synchronous rounds of message exchange. It is shown that, in the absence of eavesdropping, without using cryptography, for any ε > 0 and <italic>t</italic> = <italic>n</italic>/(3 + ε), there is a randomized protocol with <italic>O… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 89 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
57 Citations
0 References
Similar Papers

Citations

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

90 Citations

0510'85'92'00'08'16
Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…