Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
From MaRDI portal
Publication:2943606
DOI10.1145/2611462.2611468zbMath1321.68485MaRDI QIDQ2943606
Hamouma Moumen, Achour Mostefaoui, Michel Raynal
Publication date: 3 September 2015
Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2611462.2611468
randomized algorithm; abstraction; distributed algorithm; consensus; simplicity; asynchronous message-passing system; Byzantine process; broadcast abstraction; signature-free algorithm; common coin; optimal resilience
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
\textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions, Clairvoyant state machine replication, Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time, Communication Patterns and Input Patterns in Distributed Computing, Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time