arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2602.15323cs.CRcs.AIcs.LG
收藏

通过鲁棒签名实现语言模型的不可伪造水印

Unforgeable Watermarks for Language Models via Robust Signatures

Paul G. Allen School of Computer Science & Engineering, University of Washington(保罗·G·艾伦计算机科学与工程学院,华盛顿大学);Data Science Institute, University of Chicago(数据科学研究所,芝加哥大学)

Huijia Lin, Kameron Shahabi, Min Jae Song

AI总结:

本文提出了一种通过鲁棒签名实现语言模型不可伪造水印的方法,增强了内容归属的安全性和可追溯性。

摘要:

语言模型现在经常生成难以与人类写作区分开的文本,这提出了对稳健工具进行验证的迫切需求。水印技术已成为一种有前景的对策,现有研究大多集中在模型质量的保持和稳健检测上。然而,当前方案对假 attribution 的保护有限。我们通过引入两个新的保证来加强 soundness 的概念:不可伪造性和可恢复性。不可伪造性防止对手制造假阳性,即这些文本远离水印模型的任何输出,但仍然被标记为水印。可恢复性提供额外的保护层:每当检测到水印时,检测器能够识别出源文本,该文本是被标记内容的来源。这些属性增强了内容所有权,通过将内容唯一地链接到其生成模型,使安全归属和细粒度追溯成为可能。我们构建了第一个不可检测的水印方案,该方案在替换(即汉明度量下的扰动)方面是稳健、不可伪造和可恢复的。关键技术成分是一种新的密码学原语,称为鲁棒(或可恢复)数字签名,它允许验证接近已签名消息的消息,同时防止伪造远离所有先前签名消息的消息。我们证明,任何标准数字签名方案可以通过属性保持哈希函数(Boyle, LaVigne, and Vaikuntanathan, ITCS 2019)提升为鲁棒方案。

英文摘要:

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).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑