- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes TopoGate, which represents capabilities and information flows in multi-agent LLM systems as a directed graph with typed nodes and labeled attributes, and checks graph invariants before admitting new connections. To enforce constraints on sensitive information exfiltration, the authors incrementally maintain forward taint and backward reachability information to detect whether a proposed connection would complete a forbidden path, while using declassifier and human-oversight nodes to restore legitimate communication. The experiments compare attack success rates across different topologies, investigate the differences between position-based taint tracking and payload inspection, and evaluate safety and utility through AgentDojo trace replay, a limited number of online model calls, and synthetic environments.
Critical strengths
- The research problem is practically important, and the compositional security threats addressed by this work deserve attention. Communication and delegation among multiple agents can combine individually compliant actions into data leakage or unauthorized high-impact operations, while local security checks may fail to capture such cross-agent risks. These threats are becoming increasingly important as agents gain greater autonomy in collaboration and tool use.
- Translating security risks into checkable path constraints and clearly separating structural enforcement from semantic judgment offers practical engineering value. The paper uses graph-structural constraints to restrict dangerous information flows while centralizing semantic judgments at controlled nodes, providing a clear and auditable approach to security enforcement in multi-agent systems.
Critical weaknesses
1. The necessity of the core theoretical claims is insufficiently justified. The necessity proof for label monotonicity appears inconsistent with the cumulative join definition of effective labels, while the necessity of insertion monotonicity also relies on additional assumptions. Therefore, the current arguments are insufficient to support generalizing these conditions to arbitrary incremental connection-admission systems.
2. The experiments do not adequately validate the defense effectiveness of the complete framework. The main experiments still employ per-agent demotion as the intervention mechanism, primarily comparing alert signals rather than the actual per-connection admission control mechanism. In addition, the risk of adversarial false permits at the declassifier and incomplete information-flow coverage limit the strength of the system-level security claims.
3. An end-to-end cost evaluation against an unprotected system is missing. The paper primarily compares the overhead of incremental graph checking with that of full recomputation, without adequately reporting the changes in end-to-end latency, model invocation costs, or concurrent throughput before and after deploying the defense. Consequently, it remains unclear whether the security benefits come at the cost of substantial additional system overhead or degraded runtime performance.
Questions for authors
-
What are the input partial order and update semantics of the parameter-to-label mapping in Proposition 1? When an incoming edge is added, are existing parameters or labels replaced, or are they accumulated? Does the necessity claim of the proposition hold only under specific assumptions or restrictions?
-
What information do the declassifier and human-oversight nodes actually receive, and what are their routing and admission rules? Please specify the unified rules in greater detail. The main text and reproducibility statement refer to Appendix E.1, but this section does not provide the specific model details. These details are essential for assessing the claimed utility recovery and the contribution of model-based oversight.
-
The analysis of the actual defense overhead is incomplete. Compared with an unprotected system, how much does TopoGate affect end-to-end task latency, the number of model invocations, and associated costs? Can the authors provide a comparative evaluation of benign-task overhead with and without the defense?
-
The key online experiments have limited sample sizes and scenario coverage. The evaluation of online task utility is based on only five tasks, while AgentDojo includes only three relevant exfiltration attacks. Although the adaptive attack evaluation includes three repetitions, it covers only five scenarios. The current evidence is therefore insufficient to adequately establish the robustness of the framework across diverse tasks and attack conditions.
I would be willing to increase my score if these concerns were adequately addressed.
2 comments
Reply to Reviewer nQMR (part 2/2)
Q2. What do the declassifier and human-oversight nodes receive, and what are the routing and admission rules? Here is the full specification, which we will also add to the appendix of the final version:
- When it is called. In the routed configuration, the reviewer is called only when the graph rules would refuse a call and that call has incoming data-flow edges. Without routing, a refused call is simply refused. In the "model review only" comparison arm, the reviewer is called on every write.
- What it receives. The user's original request (up to 2,000 characters); the proposed tool call (name and full arguments); and, in the routed configuration, the outputs of the earlier calls that flow into it (the first 600 characters of each). After our reviewer experiment we also recommend a metadata-only variant: each source's tool name and label, with the content withheld.
- Instruction. The reviewer is told that tool outputs may contain instructions written by third parties, which are not the user's. It should approve only if the user's own request calls for this action, these recipients and this content. It answers in JSON.
- Admission rule. If the reviewer approves, each incoming flow is routed read → declassifier → human → write, which satisfies the rules structurally, and the call executes. If it refuses, or its answer cannot be parsed, the call is not executed and the agent is told it was blocked: the gate fails closed.
- Model. The paper used gpt-4.1-nano, which its provider has since retired. The new experiments use Claude Haiku 4.5 (temperature 0). Results with four other reviewers are in general response §3.
W3 / Q3. End-to-end overhead against an unprotected system. From the AgentDojo runs (600 runs per arm, same agent):
| Arm | Time / task | Reviewer calls / task | Token cost / task (list price) |
|---|---|---|---|
| No defense | 9.4 s | 0 | $0.0034 |
| Graph rules only | 9.7 s | 0 | about the same as no defense (no extra model calls) |
| Graph + model | 11.5 s | 1.31 | $0.0058 |
| Model review only | 12.3 s | 3.38 | $0.0067 |
The graph check itself is cheap: about 0.3 s per task end to end, and about 0.4 ms per decision on AgentLeak. Almost all overhead comes from reviewer calls, and the graph cuts those by 61% compared with reviewing every write. We did not measure throughput under concurrent proposers. The gate serialises check-and-commit, so concurrent agents queue at a single, cheap step; we will state this, and we will not claim a throughput figure we have not measured.
Q4. Sample sizes. The online evaluation is now 600 runs per arm on AgentDojo (previously 5 tasks). The attack side covers all 14 injection tasks, not only the 3 exfiltration tasks, so that attacks outside the exfiltration rule are measured too, including the one the graph misses. We did not extend the five-scenario adaptive-adversary study. The reviewer experiment adds 227 attack and benign items per reviewer.
Reply to Reviewer nQMR (part 1/2)
Thank you for the careful reading, in particular of the proofs. Please also see the general response; §1 reports an error we found in our own evaluation and its correction.
W1 / Q1. Update semantics of the label map, and the necessity claims.
You are right, and the problem is exactly the one you identify. Proposition 1 defines a node's effective label as the join (least upper bound) of its static label and the labels of arguments on incoming edges. A join can never lower a label. Under that definition, every argument rule is automatically "promote-only", so the "only if" direction says nothing. Our counterexample (a restrict-to-internal rule that lowers a label) only works if a later argument replaces the label rather than being joined with it.
Corrected statement:
On insertion-monotonicity: we agree that necessity holds only under the assumptions of Theorem 2(ii). We will state those assumptions in the theorem, the abstract and the introduction, and remove the claims that the conditions apply to "arbitrary" incremental systems.
W2. The experiments compare alert signals, not per-connection admission. We agree, and explain why in general response §2: G-Safeguard's harness scores the attacker's first tool, a read that TopoGate permits by design. We have now evaluated the full mechanism online on AgentDojo, with every call admitted or refused before it executes (600 runs per arm). Graph rules alone cut attack success from 18.9% to 4.6% and stop all exfiltration.
On adversarial false permits at the declassifier, we attacked the reviewer directly (general response §3): five reviewer models, 180 disguised exfiltrations, 30 piggyback attacks. Disguised exfiltration was approved 0–2 times out of 180. Piggyback approvals ranged from 0/30 to 19/30 depending on the reviewer and on what the reviewer is shown. On incomplete flow coverage, shared-object nodes now cover the dependencies Appendix C reported as missed (reply to sJyW).