Simple and efficient asynchronous byzantine agreement with optimal resilience

DOI10.1145/1582716.1582736zbMath1291.68059OpenAlexW2094982524MaRDI QIDQ5170306

Arpita Patra, Ashish Choudhury, C. Pandu Rangan

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

Byzantine agreementasynchronous networksVSSunbounded computing power

Mathematics Subject Classification ID

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

Related Items (7)

Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Secure message transmission in asynchronous networks ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation

This page was built for publication: Simple and efficient asynchronous byzantine agreement with optimal resilience