arXiv:2602.06345cs.CRcs.AI2026-02被引 8

为自主支付协议设计运行时验证框架,防止重放和上下文劫持攻击。

Zero-Trust Runtime Verification for Agentic Payment Protocols: Mitigating Replay and Context-Binding Failures in AP2

  • 通过动态生成时间限制的随机数,实现授权上下文绑定与一次性使用。
  • 在每秒1万笔高并发下,验证延迟稳定在3.8毫秒,有效防御重放与上下文重定向攻击。
  • 运行时状态仅依赖峰值并发量,内存开销可控,适合实际系统部署。

自主AI代理执行商业交易的普及推动了基于授权指令的支付授权协议(如通用商业协议UCP和代理支付协议AP2)的应用。这些协议以密码学签发的授权指令取代交互式会话授权,支持异步自治执行。尽管AP2在规范层面通过签名验证、显式绑定和过期语义提供保障,但代理执行中的重试、并发与编排等运行时行为挑战了对授权指令使用的隐含假设。本文分析了AP2授权生命周期的安全漏洞,提出一种零信任运行时验证框架,利用动态生成的时间绑定随机数,强制执行显式上下文绑定与一次性使用机制,确保授权决策在执行时刻评估,而非依赖静态发行属性。模拟评估表明,上下文感知绑定与一次性执行可防御两类互补攻击,二者缺一不可。所提框架在每秒1万笔吞吐量下仍保持约3.8毫秒的稳定验证延迟,且所需运行时状态仅由峰值并发决定,不受历史交易累积影响,证明了在极低且可预测的开销下实现可靠运行时安全的可行性。

原文摘要 · Abstract (English)

The deployment of autonomous AI agents capable of executing commercial transactions has motivated the adoption of mandate-based payment authorization protocols, including the Universal Commerce Protocol (UCP) and the Agent Payments Protocol (AP2). These protocols replace interactive, session-based authorization with cryptographically issued mandates, enabling asynchronous and autonomous execution. While AP2 provides specification-level guarantees through signature verification, explicit binding, and expiration semantics, real-world agentic execution introduces runtime behaviors such as retries, concurrency, and orchestration that challenge implicit assumptions about mandate usage. In this work, we present a security analysis of the AP2 mandate lifecycle and identify enforcement gaps that arise during runtime in agent-based payment systems. We propose a zero-trust runtime verification framework that enforces explicit context binding and consume-once mandate semantics using dynamically generated, time-bound nonces, ensuring that authorization decisions are evaluated at execution time rather than assumed from static issuance properties. Through simulation-based evaluation under high concurrency, we show that context-aware binding and consume-once enforcement address distinct and complementary attack classes, and that both are required to prevent replay and context-redirect attacks. The proposed framework mitigates all evaluated attacks while maintaining stable verification latency of approximately 3.8~ms at throughput levels up to 10{,}000 transactions per second. We further demonstrate that the required runtime state is bounded by peak concurrency rather than cumulative transaction history, indicating that robust runtime security for agentic payment execution can be achieved with minimal and predictable overhead.

支付协议零信任智能合约运行时验证

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。