Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016
classification
💻 cs.DC
keywords
agreementbyzantinecorrectionexpectednumberpolynomialtimeability
read the original abstract
This is a correction by the authors to "Byzantine Agreement in Expected Polynomial Time" which appeared in the Journal of the ACM in 2016. It corrects a failure in the paper to consider the adversary's ability to decide the number of fair coinflips in an iteration, where this number ranges between n(n-t) and n(n-2t).
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
Reducer achieves optimal-complexity asynchronous MVBA with t < n/4 resilience using collision-resistant hashes and a new SMBA primitive; Reducer++ extends to near-optimal resilience via random-oracle hashes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.