pith. sign in

arxiv: 2510.19420 · v2 · pith:IGJZWRARnew · submitted 2025-10-22 · 💻 cs.CR · cs.AI· cs.LG· cs.MA· math.OC

Securing Multi-Agent Systems Against Corruptions via Node Contribution Backpropagation

classification 💻 cs.CR cs.AIcs.LGcs.MAmath.OC
keywords agentsmulti-agentcomplexcontributiondefensedefensesdynamicexisting
0
0 comments X
read the original abstract

Multi-Agent Systems (MAS) have become a prevalent paradigm for Large Language Model (LLM) applications. However, the complex multi-agent design in MAS introduces unique trustworthiness concerns: adversarial agents can inject misleading information that propagates contagiously through the system, corrupting benign agents and leading to false outputs. Existing graph-based defenses model agents as nodes and communications as edges, yet are limited to static-graph defenses. In this paper, we propose a dynamic defense paradigm that models MAS communication as a signed directed acyclic graph and computes each agent's contribution to the final decision via backward propagation, enabling accurate identification and isolation of malicious agents to secure multi-agent task collaboration. Experimental results in complex and dynamic MAS environments demonstrate that our method notably outperforms existing MAS defense mechanisms, providing an effective guardrail for trustworthy MAS deployment. Our code is available at https://github.com/ChengcanWu/BPD.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.