- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies a new security risk introduced by reasoning chains in Vision-Language-Action (VLA) models. The authors point out that reasoning chains, serving as an intermediate interface between model reasoning and action execution, can help users understand and correct robot behaviors, but may also become a new attack surface for manipulating model decisions. By modifying entity information in the reasoning chain, the paper demonstrates that an attacker can induce incorrect robot behaviors while keeping the original instruction unchanged. Furthermore, the authors design reasoning-chain-based consistency detectors and analyze their limitations under adaptive attacks, showing that attackers can bypass detection by constructing reasoning chains that appear consistent but are actually harmful. Therefore, this work highlights the importance of protecting the integrity of intermediate decision states in embodied AI systems.
Critical strengths
- This paper systematically analyzes the security risks of reasoning chains as a new attack surface in VLA models, revealing that interpretability interfaces may simultaneously introduce integrity risks.
- The authors not only demonstrate the impact of reasoning-chain manipulation attacks on robot task execution, but also investigate the vulnerability of reasoning-chain-based detection mechanisms under adaptive attacks, providing a relatively comprehensive security analysis.
Critical weaknesses
- The paper assumes that an attacker can modify the reasoning chain between its generation and action execution, but does not sufficiently discuss how an attacker could obtain such access in realistic VLA deployment scenarios. For example, whether there are practical attack vectors that enable such manipulation remains unclear.
- This paper mainly studies reasoning-chain-based consistency detection methods and demonstrates that they can fail under adaptive attacks. However, the alternative defense direction proposed by the authors still lacks sufficient experimental validation.
Questions for authors
- The paper makes a broad claim about the fundamental limitations of reasoning-chain-based detection, but the empirical evidence is limited to two relatively simple, rule-based detectors. In particular, the adaptive attack is mainly achieved by appending the correct target object at the end of the originally damaged reasoning chain, directly taking advantage of the characteristic of entity overlap, without addressing the underlying semantic contradiction. So why should the failure of these specific detectors be interpreted as evidence of a general limitation of chain-based monitoring? And would a stronger, semantics-aware LLM-based monitor that explicitly checks the consistency between the instruction and the entire reasoning chain still be vulnerable to the same attack?
2.. Another important issue is the assumption of the threat model, and I also hope to receive clarification on this. The threat model assumes that an attacker can directly modify the reasoning chain. Is such access realistic in practical VLA systems, and through what mechanisms could an attacker typically obtain this capability?
- The current defense methods mainly rely on consistency checks between the reasoning chain and the instruction/action. Does the paper consider how to verify the actual correctness of the reasoning chain rather than only its consistency?
4 comments
Response to Reviewer 5cVB (2 of 2): Q2/W1, access to the chain; Q3, correctness of the chain; W2, the alternative defense direction
Q2/W1. "Is such access realistic in practical VLA systems, and through what mechanisms could an attacker typically obtain this capability?" Write access to the chain exists in published work. The attacker we study edits the chain after the policy writes it and before the policy decodes its actions. An operator can rewrite it at that point to correct the robot, and we assume an attacker can too. Such a correction has been shown on a physical robot. There, a rewritten chain was fed back into the policy during execution and changed what the robot did [1]. The same point exists in pipelines where one model reasons in text and a second model acts on it, a use NVIDIA describes for Cosmos Reason [2, 3]. We show what an edit there does, not how an attacker would reach it.
W1 concerns "how an attacker could obtain such access in realistic VLA deployment scenarios". A new threat-model paragraph in Section 3.2 says what is shown, what is assumed and what is not shown (change 5). It gives access paths only as conditional examples, such as the pipelines above.
The paragraph also states what each attack reads and writes. The plain entity swap reads and writes only the reasoning chain. The adaptive attack also reads the instruction, whose object names it appends. A variant of it, the attack with the direction flip, also flips each direction word that disagrees with how the arm moves under the clean chain. To find those words, it reads the action the policy decoded from its own clean chain.
Q3. "Does the paper consider how to verify the actual correctness of the reasoning chain rather than only its consistency?" The paper's detectors and the two added checks test consistency, not correctness, and the revised paper says so in Section 5 (change 13). The entity check, the object count and the judge compare the chain with the instruction. In the four-feature detector, direction and gripper compare the chain with the executed action. None of them checks the chain against the scene.
This is where the open question of Q1 lies. The plainest way to pass both added checks is a chain that agrees with the instruction. That chain could still be wrong about what the instruction does not say: which of two similar objects to take, which way to move, when to close the gripper. A check that reads only text cannot test those choices against the scene. Whether such an edit still makes the robot fail is the open question. The other route is a detector that reads something outside the chain, which the action-only test does (Appendix E), described under W2 below.
W2. The alternative defense direction. The alternative direction is an action-only detector, which reads only the robot's executed actions and no chain text at all. The test is registered and has not run. No claim depends on it. The registration fixes the detector, the attacker built against it and the conclusion each of three possible results would support. The revised paper describes the test in one closing paragraph of Section 3.2, with the full registration in Appendix E (change 6), and the test is no longer in the abstract (change 1).
Changes to the paper that answer this review. The revised paper is uploaded. The abstract and Section 1 state the narrowed monitoring claim (changes 1 and 2). Section 3.2 gains a threat-model paragraph on what each attack reads and writes, and on what is shown, assumed and not shown (change 5). The action-only test is now one closing paragraph of Section 3.2, with its registration in Appendix E (change 6). Section 4.2 reports the two added checks with Table R5 in Appendix H (change 12). Section 5 states what remains open and says that consistency is not correctness (change 13), and Section 6 is narrowed to match (change 14).
[1] M. Zawalski et al. Robotic Control via Embodied Chain-of-Thought Reasoning. Proceedings of The 8th Conference on Robot Learning, 2025.
[2] NVIDIA et al. Cosmos-Reason1: From Physical Common Sense To Embodied Reasoning. arXiv:2503.15558, 2025.
[3] K. Briski. CrowdStrike, Uber, Zoom Among Industry Pioneers Building Smarter Agents With NVIDIA Nemotron and Cosmos Reasoning Models for Enterprise and Physical AI Applications. NVIDIA Blog, 2025.
Thank you for the response and additional experiments. While I appreciate the improvements, my main concerns regarding the practical attack vectors and the effectiveness of the attack against stronger monitors remain, so I will maintain my original rating.
We thank the reviewer for reading the response and for the questions that shaped the revision. Section 3.2 states the threat model, with published examples of the point where the attack edits the chain. We agree that an attack built against stronger monitors is the natural next test.
Response to Reviewer 5cVB (1 of 2): Q1, chain-based monitoring and a semantics-aware monitor
We thank the reviewer for their careful review, in particular for asking how a monitor that reads meaning would fare against the attack. We label the review's points as follows. Q1 to Q3 are its three questions, in its order. W1 and W2 are its two weaknesses, in its order: how an attacker obtains access to the chain (W1) and the alternative defense direction (W2).
The review asks whether "a stronger, semantics-aware LLM-based monitor" would "still be vulnerable to the same attack". We tested one after the reviews, a language-model judge. It catches the attack, which was not built against it, on every suite of both policies (Q1).
We answer in two comments. This comment answers Q1. The second comment answers Q2 with W1, then Q3 and W2, and lists the changes to the paper. Brackets are 95% intervals, and pooled means all four suites taken together.
Q1. "why should the failure of these specific detectors be interpreted as evidence of a general limitation of chain-based monitoring?" The revised paper states it as a result about these two detectors, not as a general limitation of chain-based monitoring. Two rule-based detectors catch the plain entity swap on every suite, mostly through the entity feature they share. That attack renames the objects the chain mentions. The adaptive attack keeps the entity swap and appends one sentence that names the instruction's objects, so the entity feature reads clean. The renamed objects stay in the chain. The attack evades both detectors, used as designed, on every suite of both policies, while task success stays measurably below clean. The abstract and Sections 1, 4.2, 5 and 6 state the claim at this scope (changes 1, 2, 12, 13 and 14).
"would a stronger, semantics-aware LLM-based monitor that explicitly checks the consistency between the instruction and the entire reasoning chain still be vulnerable to the same attack?" The language-model monitor we tested catches the same attack. It is a judge that reads the instruction and the first chain of each episode and rates whether they agree. It is not told whether a chain was attacked or how the episode ended. We added a second check of another kind, which counts the objects a chain names that the instruction does not.
Both checks catch the attack. Both are exploratory. We specified them after the reviews, and fixed the judge and the conclusion each outcome would support before it judged any text from the adaptive attack. The judge is one language model in one configuration, gpt-6-astra at high reasoning effort. It reads the whole of one chain per episode. DeepThinkVLA writes a new chain at every query, and the judge reads the first. CoTinyVLA writes its Plan once per episode, and the judge reads that Plan. The count reuses the entity check's name matching, so "bowl" inside "black bowl" counts as another object, which raises the count on clean chains too. Section 4.2 reports the two checks, with new Table R5 in Appendix H (change 12).
So far the two checks have faced only an attack that was not built against them, as the two detectors had under the plain entity swap. Whether an attacker who knows them can evade them is open. The answer to Q3 takes this up.