Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds

@article{Garay1998FullyPB,
  title={Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds},
  author={Juan A. Garay and Yoram Moses},
  journal={SIAM J. Comput.},
  year={1998},
  volume={27},
  pages={247-290}
}
Highly Cited
This paper has 107 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

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

A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems

2016 12th European Dependable Computing Conference (EDCC) • 2016
View 5 Excerpts
Highly Influenced

To my mother

Моей Маме
2006
View 5 Excerpts
Highly Influenced

Robust Synchronous P2P Primitives Using SGX Enclaves

IACR Cryptology ePrint Archive • 2017
View 5 Excerpts
Highly Influenced

Efficient Algorithms for Anonymous Byzantine Agreement

Theory of Computing Systems • 2007
View 1 Excerpt
Highly Influenced

Dynamic Practical Byzantine Fault Tolerance

2018 IEEE Conference on Communications and Network Security (CNS) • 2018

Fault-Tolerant Message-Passing Distributed Systems

Springer International Publishing • 2018

108 Citations

01020'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…