A Privacy-Preserving Trust-Based Resilient Algorithm for Leader-Follower Consensus Against External Attacks
Distributed optimization algorithms are widely used in multi-agent system, smart grid, wireless sensor network, cloud computing and other fields, and the goal is to achieve the global optimal based on the local optimization of all nodes through cooperation. Due to their vulnerability when facing attacks, there is an urgent need to design novel resilient algorithms to deal with threats. In order to handle the Byzantine attack scenario, this paper proposes a trust-based resilient algorithm to solve the leader-follower consensus problem. Benefit from the trusted agents, all the common agents can achieve leader-follower consensus under Byzantine attacks. Furthermore, a privacy-preserving trust-based resilient algorithm is designed to protect the privacy information based on homomorphic encryption.
Authors
- Chentao Xu (ORCID: https://orcid.org/0009-0001-9762-2919)
- Qingshan Liu (ORCID: https://orcid.org/0000-0001-7672-5129)
Institutions
- Nanjing Forestry University (CN)
- Southeast University (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icaisisas64483.2025.11051591
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China