Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience

Cites Work

Unnamed Item
Unnamed Item
SoK: a consensus taxonomy in the blockchain era
Player simulation and general adversary structures in perfect multiparty computation
Efficient asynchronous verifiable secret sharing and multiparty computation
Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
Synchronous consensus with optimal asynchronous fallback guarantees
Asynchronous Byzantine agreement with optimal resilience
Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience
An Efficient Framework for Unconditionally Secure Multiparty Computation
Simple and Efficient Perfectly-Secure Asynchronous MPC
Impossibility of distributed consensus with one faulty process
Reaching Agreement in the Presence of Faults
Asynchronous Computational VSS with Reduced Communication Complexity
The Power of Shunning
The round complexity of verifiable secret sharing and secure multicast
Fast asynchronous Byzantine agreement with optimal resilience
Asynchronous secure computation
Asynchronous secure computations with optimal resilience (extended abstract)
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time

This page was built for publication: Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience