Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016

12/25/2018
by   Valerie King, et al.
0

This is a brief correction by the authors to "Byzantine Agreement in Expected Polynomial Time" which appeared in the JACM in 2016. It corrects the failure to consider the adversary's effect that results from its being able to decide the number of fair coinflips in an iteration, where the number ranges between n(n-t) and n(n-2t).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2022

Byzantine Agreement in Polynomial Time with Near-Optimal Resilience

It has been known since the early 1980s that Byzantine Agreement in the ...
research
02/16/2020

Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

King and Saia were the first to break the quadratic word complexity boun...
research
03/26/2022

Expected Constant Time Self-stabilizing Byzantine Pulse Resynchronization

In extending fast digital clock synchronization to the bounded-delay mod...
research
06/30/2022

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection

Since the mid-1980s it has been known that Byzantine Agreement can be so...
research
07/24/2019

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols

Motivated, in part, by the rise of permissionless systems such as Bitcoi...
research
11/03/2021

Byzantine Agreement with Less Communication: Recent Advances

In recent years, Byzantine Agreement is being considered in increasing s...
research
05/11/2019

Another Look at ALGORAND

ALGORAND is a celebrated public ledger technology designed by Dr. Micali...

Please sign up or login with your details

Forgot password? Click here to reset