Distributed CONGEST Algorithms against Mobile Adversaries

DOI10.1145/3583668.3594578arXiv2305.14300OpenAlexW4380874726WikidataQ130816785 ScholiaQ130816785MaRDI QIDQ6202259

Orr Fischer, Merav Parter

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.14300

zbMATH Keywords

fault toleranceCONGESTinteractive coding

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasting with locally bounded byzantine faults
• Tight bound on mobile Byzantine agreement
• Perfectly reliable and secure message transmission tolerating mobile adversary
• Asynchronous byzantine agreement protocols
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity
• Random sampling in cut, flow, and network design problems
• A coding theorem for distributed computation
• Proactive Secret Sharing with a Dishonest Majority
• How to withstand mobile virus attacks, revisited
• From partial consistency to global broadcast
• Polynomial Codes Over Certain Finite Fields
• Edge-Disjoint Spanning Trees of Finite Graphs
• Distributed Broadcast Revisited: Towards Universal Optimality
• A trade-off between information and communication in broadcast protocols
• Constant-Space Localized Byzantine Consensus
• On Proactive Perfectly Secure Message Transmission
• Asynchronous consensus and broadcast protocols
• Fast Distributed Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Reliable communication in networks with Byzantine link failures
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Optimal communication in networks with randomly distributed byzantine faults
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Information dissemination in distributed systems with faulty units
• Distributed Computing: A Locality-Sensitive Approach
• The Adversarial Noise Threshold for Distributed Protocols
• Coding for Interactive Communication: A Survey
• An efficient algorithm for byzantine agreement without authentication
• On Byzantine Broadcast in Loosely Connected Networks
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Time is not a healer
• Secure Distributed Computing Made (Nearly) Optimal
• Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
• Low Congestion Cycle Covers and Their Applications
• Distributed Algorithms Made Secure: A Graph Theoretic Approach
• How to withstand mobile virus attacks (extended abstract)
• Eavesdropping games
• Perfectly-Secure MPC with Linear Communication Complexity
• Efficient and Explicit Coding for Interactive Communication
• Broadcast in radio networks tolerating byzantine adversarial behavior
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• On Expected Constant-Round Protocols for Byzantine Agreement

This page was built for publication: Distributed CONGEST Algorithms against Mobile Adversaries