arXiv:2602.15323cs.CRcs.AI2026-02被引 1

给语言模型生成文本加不可伪造的水印,防伪溯源更可靠。

Unforgeable Watermarks for Language Models via Robust Signatures

  • 用鲁棒数字签名实现水印,支持近似内容验证。
  • 可防止伪造文本被误判为水印内容,检测准确率提升。
  • 适合需要版权确权和内容追溯的AI生成场景。

语言模型生成的文本已接近人类写作水平,亟需可靠的溯源工具。现有水印技术侧重保持模型质量与检测鲁棒性,但对虚假归属防护不足。本文提出两个新保障:不可伪造性(阻止非源模型生成的文本被误标为水印)与可恢复性(检测时能还原原始生成文本)。二者共同确保内容仅归属于特定生成模型,实现安全归属与细粒度追踪。本文构建首个在替换攻击(汉明距离下)中兼具鲁棒性、不可伪造性与可恢复性的水印方案。核心技术是新型鲁棒数字签名,可在消息与签名相近时验证,同时防止远离所有已签名消息的伪造。我们证明,任何标准数字签名方案均可通过保性质哈希函数(Boyle, LaVigne, and Vaikuntanathan, ITCS 2019)升级为鲁棒版本。

原文摘要 · Abstract (English)

Language models now routinely produce text that is difficult to distinguish from human writing, raising the need for robust tools to verify content provenance. Watermarking has emerged as a promising countermeasure, with existing work largely focused on model quality preservation and robust detection. However, current schemes provide limited protection against false attribution. We strengthen the notion of soundness by introducing two novel guarantees: unforgeability and recoverability. Unforgeability prevents adversaries from crafting false positives, texts that are far from any output from the watermarked model but are nonetheless flagged as watermarked. Recoverability provides an additional layer of protection: whenever a watermark is detected, the detector identifies the source text from which the flagged content was derived. Together, these properties strengthen content ownership by linking content exclusively to its generating model, enabling secure attribution and fine-grained traceability. We construct the first undetectable watermarking scheme that is robust, unforgeable, and recoverable with respect to substitutions (i.e., perturbations in Hamming metric). The key technical ingredient is a new cryptographic primitive called robust (or recoverable) digital signatures, which allow verification of messages that are close to signed ones, while preventing forgery of messages that are far from all previously signed messages. We show that any standard digital signature scheme can be boosted to a robust one using property-preserving hash functions (Boyle, LaVigne, and Vaikuntanathan, ITCS 2019).

水印语言模型不可伪造溯源

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