Fast byzantine agreement in dynamic networks


We study Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience heavy <i>churn</i> (i.e., nodes can join and leave the network continuously over time). Our main contributions are randomized distributed algorithms that achieve <i>almost-everywhere Byzantine agreement</i> with high probability even… (More)
DOI: 10.1145/2484239.2484275


1 Figure or Table


Citations per Year

Citation Velocity: 23

Averaging 23 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.