通过随机选密钥,让伪造者无法骗过水印验证系统。
Mitigating Watermark Forgery in Generative Models via Randomized Key Selection
- 每条查询随机选密钥,仅当恰好一个密钥能检测到水印才认定为真实
- 攻击者即使收集大量水印样本,伪造成功率也降至2%
- 不降低模型效果,适用于图像和文本等多种内容
水印技术使生成式AI服务商能够验证内容是否由其模型生成。水印是嵌入内容中的隐藏信号,可通过秘密密钥检测。主要安全威胁是伪造攻击:攻击者将服务商的水印插入非服务商生成的内容中,可能损害声誉并破坏信任。现有防御通过在同一条内容中嵌入多个密钥的水印来抵抗伪造,但这会降低模型实用性。我们提出一种可证明抗伪造的防御机制,其安全性不依赖于攻击者收集的水印样本数量,前提是攻击者无法区分不同密钥的水印。该方案对每个查询随机选择水印密钥,并仅当恰好一个密钥能检测到水印时才认定内容为真实。我们聚焦图像与文本模态,但方法具有模态无关性,因将底层水印方法视为黑盒。该方法可严格限制攻击者成功率,实证显示伪造成功率从接近100%降至2%,且计算开销极低。
原文摘要 · Abstract (English)
Watermarking enables GenAI providers to verify whether content was generated by their models. A watermark is a hidden signal in the content, whose presence can be detected using a secret watermark key. A core security threat are forgery attacks, where adversaries insert the provider's watermark into content \emph{not} produced by the provider, potentially damaging their reputation and undermining trust. Existing defenses resist forgery by embedding many watermarks with multiple keys into the same content, which can degrade model utility. However, forgery remains a threat when attackers can collect sufficiently many watermarked samples. We propose a defense that is provably forgery-resistant \emph{independent} of the number of watermarked content collected by the attacker, provided they cannot easily distinguish watermarks from different keys. Our scheme does not further degrade model utility. We randomize the watermark key selection for each query and accept content as genuine only if a watermark is detected by \emph{exactly} one key. We focus on the image and text modalities, but our defense is modality-agnostic, since it treats the underlying watermarking method as a black-box. Our method provably bounds the attacker's success rate and we empirically observe a reduction from near-perfect success rates to only $2\%$ at negligible computational overhead.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。