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

DOI10.1016/J.TCS.2024.114492MaRDI QIDQ6204550zbMATH OpenFDO

Authors Ashish Choudhury

Publication date 28 March 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114492

zbMATH Keywords

almost-surely terminationByzantine agreementcommon coinnon-threshold adversariessecret sharing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Simple and efficient asynchronous Byzantine agreement with optimal resilience
• Almost-surely terminating asynchronous Byzantine agreement revisited
• Asynchronous Byzantine agreement with optimal resilience
• An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
• The power of shunning: efficient asynchronous Byzantine agreement revisited

Cites work

• An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Asynchronous Byzantine agreement with optimal resilience
• Asynchronous computational VSS with reduced communication complexity
• Asynchronous secure computation
• Asynchronous secure computations with optimal resilience (extended abstract)
• Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Fast asynchronous Byzantine agreement with optimal resilience
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1952886 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Player simulation and general adversary structures in perfect multiparty computation
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Reaching Agreement in the Presence of Faults
• Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• SoK: a consensus taxonomy in the blockchain era
• Synchronous consensus with optimal asynchronous fallback guarantees
• The power of shunning: efficient asynchronous Byzantine agreement revisited
• The round complexity of verifiable secret sharing and secure multicast

Cited in

(1)

• Revisiting asynchronous fault tolerant computation 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)