Efficient Byzantine Reliable Broadcast with Low Communication and Time Complexity
This paper introduces novel mechanisms to lower the communication and computational complexity of Byzantine reliable broadcast protocols in asynchronous networks with less than a third of Byzantine nodes. Two algorithms are presented that achieve an overhead factor of 2 and 3/2 respectively, while also optimizing the time complexity.
Efficient Transformation of Synchronous Byzantine Agreement Algorithms to Partial Synchrony
Oper, a generic transformation, enables translating any deterministic synchronous Byzantine agreement algorithm to the partially synchronous setting while preserving its optimal per-process bit complexity and latency.
Federated Computing: Decentralized Data Processing and Collaborative Machine Learning
Federated Computing enables collaborative data processing and machine learning across distributed devices without compromising individual data privacy.
Selective Population Protocols: Efficient Median Computation
Selective Population Protocols introduce efficient solutions for distributed computing problems.
Lumiere: Making Optimal BFT for Partial Synchrony
Lumiere enables optimal BFT consensus solutions in partial synchrony with 푂(푛2) worst-case communication complexity.
Lumiere: Optimizing BFT Protocols in Partial Synchrony
Lumiere introduces an optimistically responsive BVS protocol for BFT consensus solutions in partial synchrony, maintaining optimal worst-case communication complexity.
Selective Population Protocols: Efficient Median Computation
Efficiently compute the median using selective population protocols.
Randomized Kaczmarz in Adversarial Distributed Setting: Robust Optimization for Linear Systems
Developing robust distributed methods for solving linear systems in the presence of adversaries is crucial for practical applications.
Error-Free Near-Optimal Validated Agreement in Byzantine Consensus Algorithms
The authors present Ext, an error-free synchronous Byzantine agreement algorithm with external validity, achieving near-optimal bit complexity. They address limitations of existing algorithms by focusing on practical applications like state machine replication and blockchain protocols.
Analyzing Task Graph Scheduling Algorithms: A Detailed Comparison
The author compares task graph scheduling algorithms using an adversarial approach to reveal performance discrepancies, highlighting the limitations of traditional benchmarking methods.
© 2024 by Linnk AI