AI 中文总结
针对大语言模型水印需求，提出无同步水印方案，由相邻令牌生成二元同余作水印，从代数角度分析恢复问题，讨论解码算法，该方法能抗多种操作，避免同步问题，为嵌入不同长度秘密身份提供灵活框架。
AI 中文摘要
大语言模型迫切需要可靠的水印方法，以便在对生成文本进行归因的同时，对编辑和改写保持鲁棒性。我们提出了一种新颖的无同步水印方案，每个水印由一对相邻令牌生成的单个二元同余组成。对于每个令牌对，加密哈希确定代表秘密身份的里德 - 所罗门多项式的评估点，而多项式评估的奇偶性决定嵌入到该对第二个令牌中的水印位。由于每个同余是自包含的且仅取决于局部令牌对，该方案自然能抵抗插入、删除和令牌重新排序。我们从代数角度分析恢复问题，讨论适用于不同身份大小的几种解码算法，并将水印损坏建模为二元对称信道。分析表明，即使对于相对较高的令牌损坏率，可靠恢复也仅需少量冗余。与现有基于块的水印方案不同，该方法避免了同步问题，同时为嵌入短和长秘密身份提供了灵活框架。
英文摘要
Large Language Models (LLMs) have created an urgent need for reliable watermarking methods that enable attribution of generated text while remaining robust to editing and paraphrasing. We propose a novel synchronization-free watermarking scheme in which every watermark consists of a single binary congruence generated from a pair of neighbouring tokens. For each token pair, a cryptographic hash determines an evaluation point of a Reed--Solomon polynomial representing the secret identity, while the parity of the polynomial evaluation determines the watermark bit embedded into the second token of the pair. Since each congruence is self-contained and depends only on the local token pair, the proposed construction is naturally resistant to insertions, deletions, and token reordering. We analyse the recovery problem from an algebraic perspective, discuss several decoding algorithms suitable for different identity sizes, and model watermark corruption as a Binary Symmetric Channel. The analysis shows that reliable recovery requires only a small redundancy even for relatively high token corruption rates. Unlike existing block-based watermarking schemes, the proposed method avoids synchronization problems while providing a flexible framework for embedding both short and long secret identities.
