- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper studies the detection of adversarially prompted agents in multi-agent debate and proposes DICE, a training-free method based on token-level confidence. DICE computes each agent’s confidence from top-k token log-probabilities and votes on the early part of the response, flagging agents whose confidence falls in the minority group. Experiments across multiple reasoning and attack benchmarks show that DICE consistently reduces attack success rates at low cost compared with existing defenses. Additional analyses examine robustness under different attack settings.
Critical strengths
-
DICE detects compromised agents from relative confidence differences among agents answering the same question, without requiring any training, and thus avoids the cross-task performance degradation of graph-based methods. This is of practical value, since training data for the target task is often unavailable in real deployments.
-
DICE only requires token log-probabilities, with no additional LLM calls or training overhead, and no cost for generating training data. This makes it suitable as a lightweight, plug-and-play defense component.
Critical weaknesses
-
On most datasets, the attacked and benign agents use different prompts and output formats (e.g., benign agents must follow fixed reason/answer tags or ReAct template), so the confidence differences detected by DICE may come from format differences rather than adversarial intent. This means an attacker who imitates the benign format could easily evade detection, and the authors provide no experiments to rule this out.
-
In real deployments, there may be no attacker most of the time, yet the paper does not evaluate the attack-free setting, and the voting rule necessarily flags some agents even when no attacker is present.
Questions for authors
-
Does the precision in Figure 4 count only the rounds after attack injection? How are it and the all-round precision in Table 8 each computed?
-
How does DICE perform against adaptive attacks from an adversary who knows the defense mechanism? For example, if an attacker first fills the initial 20% of the response with normal reasoning or a restatement of the question and then pivots to the wrong answer, can DICE still detect it?
-
In real deployments, the number of attackers is usually unknown. How should one choose between DICE and DICE-low in practice?
I would be happy to reconsider my rating if the authors can address these concerns.
Thank you to the authors for the detailed response and the additional results. I decide to maintain my rating.