Byzantine agreement in polynomial time with near-optimal resilience

DOI10.1145/3519935.3520015arXiv2202.13452OpenAlexW4225815768MaRDI QIDQ6083503

Shang-En Huang, Seth Pettie, Leqi Zhu

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.13452

zbMATH Keywords

randomized algorithmsByzantine agreementcoin-flipping gamesasynchronous message passing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Byzantine agreement in polynomial time with near-optimal resilience