Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages

DOI10.1145/2611462.2611468zbMath1321.68485OpenAlexW2223468118MaRDI 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

zbMATH Keywords

randomized algorithmabstractiondistributed algorithmconsensussimplicityasynchronous message-passing systemByzantine processbroadcast abstractionsignature-free algorithmcommon coinoptimal resilience

Mathematics Subject Classification ID

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

Related Items

Clairvoyant state machine replication ⋮ 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 ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions