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

Cites Work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204550)