- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies privacy failures caused by policy information being split across agents. It defines context-fragmented violations and distinguishes them from losing source-policy bindings during a transformation. Distributed Sentinel carries identified source bindings and checks actions before execution. The experiments separately examine missing information, binding preservation, enforcement placement, and mapping errors. Supplying policy information raises decision coverage from 65.8% to 98.3% on 120 independently annotated cases. On 64 controlled allowed/forbidden pairs, Sentinel and matched controls make all decisions correctly. A separate 126-case study finds substantial false blocking in the frozen mapping pipeline; renaming fields in saved outputs explains many of these errors.
Critical strengths
S1. The paper distinguishes missing policy information from losing a source binding during transformation. Definition 2.2 also keeps the policy check fixed between local and global views, so the mismatch cannot be explained simply by applying different rules.
S2. The Q1 analysis separates abstention from an incorrect decision. Of the 41 newly correct answers, 38 were previously abstentions. This gives a more precise account of what supplying policy information actually improves.
S3. The external mapping study identifies an interface problem by renaming keys while keeping the saved model outputs otherwise unchanged. This removes 40 false blocks and introduces one slip. The authors retain the poor original result and clearly separate the later repair from independent validation.
Critical weaknesses
W1. The conceptual advance over existing information-flow control is limited. Context-fragmented violations describe decisions made with incomplete policy information, while source-binding propagation and pre-effect checks follow established enforcement principles. The separation of failure types is useful, but I am less convinced that it amounts to a substantial new security model.
W2. The framework preserves bindings that have already been identified correctly. It does not determine which sources still govern a rewritten artifact or when a restriction can be released. Conservative source union can therefore retain irrelevant restrictions, leaving a gap between authenticating policy metadata and deciding whether that policy applies to the content.
Questions for authors
What security behavior is specific to the community setting beyond a persistent assistant applying contextual access-control rules across sessions?
4 comments
Thank you for the response! I agree with you that separating missing policy info from lost bindings can help to identify problems. But, the concern about conceptual contribution still the same. The distincition truely useful for diagnosis. However, I still think that the paper adds little to existing info flow control methods. If you give me more evidence, I'm happy to raise the point.
Thank you for clarifying your concern.
Our methodological contribution is to locate policy-enforcement failures through controlled comparisons of available information, recorded bindings, and input interfaces. Definition 2.2 specifies what must remain fixed when comparing local and full-state checks.
The interface replay asks a separate question: does the rejection persist when the same model response is supplied through corrected fields? The fresh-case study then tests whether a mapper repair improves task completion. The results reported in our rebuttal are summarized below.
| Step | Evidence | What it supports |
|---|---|---|
| Locate the failure in the original 126-case study | Missing inputs account for 53/54 false blocks and 56/64 reference-BLOCK cases. | The same failure produces incorrect rejection and apparently correct blocking; the final verdict alone does not establish successful policy reasoning. |
| Test the diagnosis on saved outputs | Renaming fields removes 40 false blocks and introduces one slip, without changing model responses. | The model responses stay fixed, so the corrections identify a problem at the input interface. |
| Evaluate the frozen schema-aware mapper on 56 fresh cases | Allowed-task stops: 13/28 → 1/28; strict permitted completion: 0/28 → 25/28; prohibited approvals: 0/28 → 0/28; full-workflow exact match: 0/56 → 51/56. | The repair improves permitted completion on fresh cases while the downstream enforcement stays unchanged. |
The last row compares the original and repaired mapper prompts using the same model snapshot and downstream engine. It uses the scenario authors' construction references, separately from the original independent study. Strict completion requires an ALLOW decision and an exact match to the full specified workflow. Fixed-output renaming and the fresh-case mapper evaluation are distinct interventions.
The structured-handoff study examines a different stage: all bindings survive 72 transformations, yet seven prohibited sends are proposed and intercepted. This study tests action checking with intact bindings; the interface study tests whether the checker receives the required inputs.
Thank you again for taking the time to discuss these results with us.
Thank you for the response. I am more clearly on how your method helps find where a policy check fails. I still think the paper adds little to existing work on information flow control. I will remain unchange.
Response to Reviewer 8rii
Thank you for the careful reading, particularly the distinction you draw between preserving a binding and deciding whether it still applies after rewriting.
W1: What conceptual contribution goes beyond incomplete-information decisions and established IFC enforcement?
We distinguish failures that call for different changes to an LLM workflow. For example, 53/54 false blocks in the external pipeline are missing-input exits; 56/64 reference-BLOCK cases stop there too. Renaming keys in the saved outputs removes 40 false blocks and introduces one slip, without asking the model for another answer. This locates a repair at the input interface.
Definition 2.2 fixes the predicate, action arguments, executed prefix, missing-input convention, and execution boundary. Only the available context changes. This lets us attribute a discrepancy to missing information without also changing the rule or the execution history. The 64 certified allowed/forbidden pairs provide executable examples: each pair has identical downstream observations but opposite full-state permissions. Registry, CaMeL, and Sentinel agree when given the full state under the tested predicates.
The definitions also separate two testable conditions. A CFV requires every action to pass its local check and at least one to violate the full-state check under the same contract. Semantic laundering requires retained source meaning with a lost binding. Neither implies the other: policy state may never have been available locally, and a lost binding may concern an ultimately permitted use. This determines which observations an experiment must collect.
The experiments connect these distinctions to specific interventions:
The free-form handoffs forward preceding outputs in full, without host code stripping metadata. Raw reader agreement is 84.7% for meaning and 98.6% for bindings. We retain agreed labels and mark disputed fields UNCERTAIN, keeping all items. These are controlled tasks: 144 source items are nested within 36 outputs and 18 workflow pairs. The fresh-case results use the scenario authors' construction references, with 0/28 prohibited-task approvals before and after repair and the same downstream enforcement engine.
Sentinel records bindings, decisions, and effects to check each diagnosis and its corresponding intervention.
W2: How are semantic applicability and restriction release handled, given conservative source union?
In our notation, Dep(d) denotes semantic dependencies and T(d) the recorded bindings. The preservation result concerns T(d). End-to-end enforcement also requires complete relevant bindings, faithful policy encoding, and trusted interception; authentication establishes metadata integrity.
The new readers check whether source-attributable facts survive and whether the output still links them to the relevant recipient restrictions. The runtime retains recorded bindings conservatively, which can retain a restriction even when its source is no longer semantically relevant. Releasing it would require a separately validated semantic declassification rule. We therefore report permitted completion alongside blocking. In the paired supplied-binding study, 64/64 permitted sends complete and 0/64 forbidden sends are delivered.
Q1: What security behavior is specific to a community beyond a persistent assistant across sessions?
The relevant features are multiple policy owners, different local views, and handoffs between them. In the paper's Titan example, R&D owns the disclosure restriction, while marketing receives a derived summary. The publication check still needs that restriction even though marketing cannot access the source record. A persistent assistant with the same separation of state faces the same issue. If that assistant retains the relevant policy state at every checked action, this particular local/full-state mismatch is absent. The community setting makes the separation concrete: one participant owns the policy, another transforms the content, and a third may execute the action. The criterion requires applicable source-owned policies to be available at that final boundary, regardless of how many model instances implement these roles.
Thanks again for your review.