Distributed computing in asynchronous networks with byzantine edges

DOI10.1007/3-540-61332-3_169MaRDI QIDQ6184680zbMATH OpenFDO

Authors Vasant Shanbhogue, Moti Yung

Publication date 29 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)

Recommendations

• Edge Fault Tolerance on Sparse Networks
• On Optimal Probabilistic Asynchronous Byzantine Agreement
• Byzantine Fault Detectors for Solving Consensus
• Distributed computability in Byzantine asynchronous systems
• Fast agreement in networks with Byzantine nodes

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A new solution for the Byzantine generals problem
• Distributed agreement in the presence of processor and communication faults
• Fault-tolerant distributed algorithm for election in complete networks
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Tolerating linear number of faults in networks of bounded degree

Cited in

(1)

• Invited talk: Resilient distributed algorithms

This page was built for publication: Distributed computing in asynchronous networks with byzantine edges

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