Byzantine fault-tolerant distributed set intersection with redundancy (2402.08809v1)
Abstract: In this report, we study the problem of Byzantine fault-tolerant distributed set intersection and the importance of redundancy in solving this problem. Specifically, consider a distributed system with $n$ agents, each of which has a local set. There are up to $f$ agents that are Byzantine faulty. The goal is to find the intersection of the sets of the non-faulty agents. We derive the Byzantine set intersection problem from the Byzantine optimization problem. We present the definition of $2f$-redundancy, and identify the necessary and sufficient condition if the Byzantine set intersection problem can be solved if a certain redundancy property is satisfied, and then present an equivalent condition. We further extend our results to arbitrary communication graphs in a decentralized setting. Finally, we present solvability results for the Byzantine optimization problem, inspired by our findings on Byzantine set intersection. The results we provide are for synchronous and asynchronous systems both.
- Atomic snapshots using lattice agreement. Distributed Computing, 8:121–132, 1995.
- Machine learning with adversaries: Byzantine tolerant gradient descent. In Proceedings of the 31st International Conference on Neural Information Processing Systems, pages 118–128, 2017.
- Graph theory with applications, volume 290. Macmillan London, 1976.
- Distributed statistical machine learning in adversarial settings: Byzantine gradient descent. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(2):1–25, 2017.
- Algorithms. 2006.
- Fault-tolerance in distributed optimization: The case of redundancy. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 365–374, 2020.
- Byzantine fault-tolerance in decentralized optimization under 2f-redundancy. In 2021 American Control Conference (ACC), pages 3632–3637. IEEE, 2021.
- Chiu-Yuen Koo. Broadcast in radio networks tolerating byzantine adversarial behavior. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 275–282, 2004.
- A new approach to distributed hypothesis testing and non-bayesian learning: Improved learning rate and byzantine resilience. IEEE Transactions on Automatic Control, 66(9):4084–4100, 2020.
- Broadcasting with locally bounded byzantine faults. Information Processing Letters, 93(3):109–115, 2005.
- Lili Su. Defending distributed systems against adversarial attacks: consensus, consensus-based learning, and statistical learning. ACM SIGMETRICS Performance Evaluation Review, 47(3):24–27, 2020.
- Asynchronous distributed hypothesis testing in the presence of crash failures. arXiv preprint arXiv:1606.03418, 2016.
- Broadcast using certified propagation algorithm in presence of byzantine faults. Information Processing Letters, 115(4):512–514, 2015.
- Reliable broadcast in networks with trusted nodes. In 2019 IEEE global communications conference (GLOBECOM), pages 1–6. IEEE, 2019.
- Iterative approximate byzantine consensus in arbitrary directed graphs. In Proceedings of the 2012 ACM symposium on Principles of distributed computing, pages 365–374, 2012.
- Distributed learning with adversarial agents under relaxed network condition. arXiv preprint arXiv:1901.01943, 2019.
- Douglas Brent West et al. Introduction to graph theory, volume 2. Prentice hall Upper Saddle River, 2001.
- Byzantine-robust distributed learning: Towards optimal statistical rates. In International Conference on Machine Learning, pages 5650–5659. PMLR, 2018.
- Lattice agreement in message passing systems. arXiv preprint arXiv:1807.11557, 2018.