Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time

DOI10.1007/978-3-319-25258-2_14zbMath1471.68027OpenAlexW2295788380MaRDI QIDQ3460716

Achour Mostefaoui, Michel Raynal

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Communication complexity, information complexity (68Q11)

Related Items

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• Unnamed Item
• Unnamed Item
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Asynchronous byzantine agreement protocols
• On k -set consensus problems in asynchronous systems
• Error-free multi-valued consensus with byzantine failures
• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• Concurrent Programming: Algorithms, Principles, and Foundations
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Asynchronous consensus and broadcast protocols
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Byzantine Fault Detectors for Solving Consensus
• On deterministic abortable objects
• Breaking the O ( n ² ) bit barrier
• k-set agreement with limited accuracy failure detectors
• Abortable and query-abortable objects and their efficient implementation