Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
From MaRDI portal
Publication:3177735
DOI10.1145/2785953zbMath1426.68025OpenAlexW2102764738MaRDI QIDQ3177735
Michel Raynal, Achour Mostefaoui, Hamouma Moumen
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2785953
randomized algorithmdistributed algorithmconsensussimplicityasynchronous message-passing systemByzantine processbroadcast abstractionsignature-free algorithmcommon coinoptimal resilience
Related Items (4)
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ About informatics, distributed computing, and our job: a personal view
This page was built for publication: Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time