Lower bound for scalable Byzantine Agreement

DOI10.1145/1146381.1146424zbMath1314.68144OpenAlexW2047109080MaRDI QIDQ5177290

Bruce M. Kapron, Dan Holtby, Valerie King

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146424

zbMATH Keywords

lower boundsdistributed computingprobabilisticmalicious adversaryByzantine agreementrandomizedscalablenon-adaptive adversary

Mathematics Subject Classification ID

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Lower bound for scalable Byzantine Agreement