为大模型代理轨迹设计抗篡改水印,确保来源可追溯且不改变行为。
TRACE: A Two-Channel Robust Attribution Watermark via Complementary Embeddings for LLM-Agent Trajectories

- 用双通道水印:选择通道基于内容,计数通道基于位置骨架,互不干扰。
- 在长轨迹上检测置信度达z=100,删除70%步骤仍可识别,重写不影响计数通道。
- 适合需要防篡改、防盗版的LLM代理部署场景,尤其对高价值服务保真性要求高时。
LLM代理通过分销商触达用户,分销商可能重命名或替换为廉价模型。当归属权争议时,溯源依赖于轨迹日志(工具调用、观察结果和执行动作记录,而非模型推理过程),而该日志由分销商存储并处理以计量使用量。因此,水印必须在对手拥有完整读写权限的情况下依然有效,现有代理水印因直接从日志中读取归属信息而无法满足此条件。我们提出TRACE,据我们所知首个在动作选择上无失真的水印方案,具备删除自同步能力和无条件重写不变性。删除会破坏基于位置的密钥,重写会改变内容,故删除鲁棒密钥需来自内容,重写鲁棒密钥须来自位置,单一密钥无法兼顾。但轨迹可容纳双水印:选择通道以局部内容为密钥,使用无失真采样器决定动作,使代理分布不变,检测可在删除后自动重同步;计数通道以日志骨架为密钥,不受任何重写影响。我们证明该行为水印的信号代价为决策熵,每次决策至少消耗一半熵,确定性决策不消耗。同时,若要擦除双通道,分销商必须破坏其销售的轨迹。在ToolBench与ALFWorld测试中,TRACE保持未加水印代理的成功率,选择通道在长轨迹上检测得分接近z=100,支持70%步数删除下的可检测性,且计数通道在任意强度的语言模型重写下完全不变。
原文摘要 · Abstract (English)
LLM agents reach users through resellers, who may rebrand a developer's agent or substitute a cheaper model. When provenance is disputed, attribution rests on the trajectory log (the record of tool calls, observations, and executed actions, not the model's reasoning), which the reseller stores and processes to meter usage. A watermark must therefore survive an adversary with full read/write access to the very evidence it is detected from; existing agent watermarks do not, as their attribution is read straight off that log. We present TRACE, to our knowledge the first agent watermark that is distortion-free in its action choices, self-synchronizing under deletion, and unconditionally invariant under rewriting. Deletion desynchronizes a position-derived key and rewriting alters content, so a deletion-robust key must come from content and a rewrite-robust key from position, and no single key serves both. A trajectory, however, has room for two watermarks. TRACE superposes a selection channel that sets which action is chosen, keyed on local content with a distortion-free sampler, so the agent's distribution is provably unchanged and detection resynchronizes after deletions, and a tally channel that sets how many records each decision group holds, keyed on the log's skeleton alone, which no rewriting can touch. We prove this behavioral watermark's signal is bought with decision entropy, each decision paying at least half its entropy and deterministic decisions nothing, and that erasing both channels forces the reseller to corrupt the trajectories it resells. On ToolBench and ALFWorld, TRACE matches the unwatermarked agent's success rate while its selection channel reaches detection scores near z = 100 on long-horizon trajectories, stays detectable under 70% step deletion, and keeps a tally channel exactly unchanged under LLM rewriting of any strength.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。