Signature-free asynchronous binary Byzantine consensus with t

DOI10.1145/2785953MaRDI QIDQ3177735zbMATH OpenOpenAlexFDO

Authors Achour Mostefaoui, Hamouma Moumen, Michel Raynal

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

zbMATH Keywords

asynchronous message-passing systembroadcast abstractionByzantine processcommon coinconsensusdistributed algorithmoptimal resiliencerandomized algorithmsignature-free algorithmsimplicity

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• 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
• Asynchronous byzantine agreement protocols
• When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus

Cited in

(25)

• Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
• Consensus in Byzantine asynchronous systems
• Synchronous consensus with optimal asynchronous fallback guarantees
• Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
• Minimal synchrony for Byzantine consensus
• Signature-free asynchronous Byzantine consensus with \(t < n/3\) and \(O(n^2)\) messages
• Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
• When 3f + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
• Constant-Space Localized Byzantine Consensus
• Bosco: One-Step Byzantine Asynchronous Consensus
• Trading off t-resilience for efficiency in asynchronous Byzantine reliable broadcast
• On the versatility of Bracha's Byzantine reliable broadcast algorithm
• Hybrid fault-tolerant consensus in asynchronous and wireless embedded systems
• Signature-free communication and agreement in the presence of Byzantine processes
• About informatics, distributed computing, and our job: a personal view
• Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
• Improved extension protocols for Byzantine broadcast and agreement
• Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
• Asymmetric distributed trust
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Asymptotically optimal adaptive asynchronous common coin and DKG with silent setup
• \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
• Probabilistic Byzantine fault tolerance

This page was built for publication: Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177735)