Fast asynchronous Byzantine agreement with optimal resilience

DOI10.1145/167088.167105zbMath1310.68038OpenAlexW2006699751MaRDI QIDQ5248470

Tal Rabin, Ran Canetti

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167105

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (22)

High-threshold AVSS with optimal communication complexity ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience ⋮ Secure message transmission in asynchronous networks ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Randomized protocols for asynchronous consensus ⋮ Resilient-optimal interactive consistency in constant time ⋮ Randomization can be a healer: consensus with dynamic omission failures ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Unnamed Item

This page was built for publication: Fast asynchronous Byzantine agreement with optimal resilience