An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
DOI10.1145/1400751.1400804zbMath1301.68047OpenAlexW2039727452MaRDI QIDQ2934364
Joseph Y. Halpern, Danny Dolev, Ittai Abraham
Publication date: 12 December 2014
Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1400751.1400804
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)
Related Items (12)
This page was built for publication: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience