Invited talk: Resilient distributed algorithms

DOI10.1007/978-3-030-67731-2_3MaRDI QIDQ831782zbMATH OpenOpenAlexFDO

Authors M. Parter

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-67731-2_3

zbMATH Keywords

secure computationCONGESTresilient computation

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Distributed algorithms made secure: a graph theoretic approach
• Reliable broadcast in unknown fixed-identity networks
• Fast Byzantine agreement in dynamic networks
• Crash-tolerant consensus in directed graph revisited (extended abstract)
• Edge Fault Tolerance on Sparse Networks

Cites work

• scientific article; zbMATH DE number 7561582 (Why is no real title available?)
• A minimal model for secure computation (extended abstract)
• Asynchronous consensus and broadcast protocols
• Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
• Distributed Computing: A Locality-Sensitive Approach
• Distributed algorithms made secure: a graph theoretic approach
• Distributed computing in asynchronous networks with byzantine edges
• Fast Distributed Agreement
• Fault-tolerant broadcasting and gossiping in communication networks
• Fault-tolerant logical network structures
• Fault-tolerant spanners
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Low congestion cycle covers and their applications
• On Expected Constant-Round Protocols for Byzantine Agreement
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Reaching Agreement in the Presence of Faults
• Replacement paths and distance sensitivity oracles via fast matrix multiplication
• Secure Distributed Computing Made (Nearly) Optimal
• Small cuts and connectivity certificates: a fault tolerant approach
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Time is not a healer (preliminary version)

Cited in

(2)

• Distributed algorithms made secure: a graph theoretic approach
• scientific article; zbMATH DE number 1418337 (Why is no real title available?)

This page was built for publication: Invited talk: Resilient distributed algorithms

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