跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 06:41 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 07:49 — 2026-11-22 07:49(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 06:41最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 06:39(北京时间)
新论文 · v1arXiv:2611.20454

KVMARK: Fragile Watermarking for KV-Cache Integrity in Latent Multi-Agent Systems

Marjan Beheshti, Ronghua Xu

原文摘要

Latent multi-agent communication directly transfers Key-Value (KV) cache tensors between transformer-based agents, bypassing text serialization entirely. While computationally efficient and reasoning accurate, this communication channel is opaque and vulnerable to man-in-the-middle tampering, a threat vector unaddressed by existing text-based or behavioral watermarks, which cannot operate on continuous internal representations. To address this vulnerability, we propose KVMark, a training-free, zero-bit KV-cache watermarking framework to verify inter-agent handoff integrity. Our framework introduces four core technical components: (1) position-dependent sign patterns that guarantee first-order statistical invisibility while preserving downstream attention survival; (2) per-head sign patterns with aligned detection to defeat head-averaging attacks; (3) a three-tier depth-aware strength schedule that equalizes detection sensitivity across transformer layers while maintaining invisibility against nine statistical profiling strategies; and (4) content-bound key derivation that cryptographically binds watermarks to input contexts, preventing replay attacks under Kerckhoffs's principle. Empirical evaluation on a four-agent latent pipeline demonstrates $100\%$ detection across $1{,}500$ handoffs with a $0.0\%$ false positive rate ($\text{AUROC}=1.0$), $100\%$ layer-level tamper localization ($17/17$ attacked layers identified with $0/19$ false positives), and no statistically significant reasoning accuracy degradation across four benchmarks ($N{=}300$--$500$). Furthermore, the framework enables multi-hop cascade verification to isolate compromised agents (500/500 detection at three hops), withstands adaptive white-box adversaries and the Out-of-Sight DiffMean attack (up to $α=8.0$), and generalizes seamlessly to Qwen3-8B without re-tuning (1,500/1,500 TPR).

cs.CR

新论文 · v1arXiv:2610.40204

Attack-Resilient Multi-Bit Image Watermarking Framework via Latent Coordinate Sign Clamping

Marjan Beheshti, Ronghua Xu

原文摘要

Watermarking is essential for image copyright protection and attribution, yet existing methods suffer from fundamental trade-offs among post-hoc applicability to pre-existing images, multi-bit capacity, training-free deployment, and adversarial resilience. To address these limitations, we propose a training-free watermarking framework that exploits the overcompleteness of diffusion latent spaces to embed multi-bit payloads into arbitrary images while preserving high visual quality. Additionally, we develop a three-layer decoding pipeline that combines magnitude-weighted majority voting, BCH, and Chase decoding to maximize message-extraction accuracy in the presence of channel noise. To counter active adversaries, our framework integrates a steganalysis-resistant noise camouflage layer and a dual-layer forgery defense that combines perceptual hashing with a Reed-Solomon fuzzy commitment scheme over CLIP features. Empirical evaluations demonstrate that our method applies to both natural and AI-generated images with a scalable $32\text{--}128$-bit capacity. Furthermore, it effectively mitigates advanced removal vectors ($94.6\%$ decode rate against CtrlRegen+ regeneration attacks) and secures robust forgery detection ($98.8\%$ accuracy via joint CLIP and RS fuzzy commitment mechanism).

cs.CR