AIDB Daily Papers
LLMエージェントの長期記憶をポイズニング攻撃から保護する:機械チェックされた保証付きの改変不能・起源拘束型権威
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- LLMエージェントの長期記憶へのポイズニング攻撃という新たな脆弱性を研究し、既存の防御策の限界を明らかにした。
- 本研究では、エージェント自身の要約やツールの利用などを悪用する「ラウダリング」攻撃を特定し、内容や派生履歴に基づく防御策が通用しないことを理論的に証明した。
- 提案手法TMA-NMは、改変不能な起源拘束型権威により、ラウダリング攻撃を含め、あらゆるポイズニング攻撃に対して0%の成功率を達成し、正当な利用性を維持した。
Abstract
LLM agents increasingly rely on persistent long-term memory, which creates a critical vulnerability that we study here: memory poisoning. An adversary can store untrusted content in one session that later steers a consequential action, such as a payment, a setting change, or data exfiltration, in a future session. Existing defenses base a memory item's authority to act on either its content (detection or trust-scoring) or its derivation history (lineage). We show that both signals are malleable. An attacker can launder an untrusted origin through three channels specific to LLM agents: the agent's own summarization, a trusted-tool echo, and manufactured corroboration. Each makes the content look benign and breaks or flips its derivation edge to ``trusted.'' We formalize malleability for the memory write-retrieve-act pipeline and prove a machine-checked separation theorem. No content- or lineage-based defense is sound under laundering (T1), write-time origin binding is necessary (T2), and non-malleable origin-bound authority with Sybil-resistant corroboration-gated elevation is sufficient (T3). Our construction, TMA-NM (Tamper-evident Memory Authority, Non-Malleable), instantiates non-malleable information-flow control (IFC) for LLM-agent memory. A cross-defense, cross-attack, and cross-model benchmark over eight frontier models shows that existing defenses fail exactly where the theory predicts (up to 68% laundering attack-success), while TMA-NM reaches 0% attack success on both direct and laundering attacks across all models and channels, at full legitimate utility. We release the benchmark, harness, and machine-checked TLA+ models to support reproducibility.
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: