理想伪随机码
Ideal Pseudorandom Codes
AI总结:
本研究证明了现有伪随机码的自适应鲁棒性,定义了理想伪随机码,并提出了构造具有线性信息率的理想及CCA安全伪随机码的方法,为生成式AI水印提供了更强的鲁棒性保证。
摘要:
伪随机码是一种纠错码,其性质是:任何高效敌手都无法将编码与均匀随机字符串区分开来。它们由 Christ 和 Gunn 于近期提出 [CRYPTO 2024],用于对随机化算法(如生成式 AI 模型)的输出进行水印标记。此后,人们提出了多种伪随机码的构造方案,但其中没有一个能对依赖于先前所见码字的错误信道具有鲁棒性。这种更强的鲁棒性被称为自适应鲁棒性,对于水印标记的实际应用具有重要意义。\n在本工作中,我们展示了以下结果。\n- 自适应鲁棒性:我们证明了 Christ 和 Gunn 的伪随机码是自适应鲁棒的,解决了 Cohen、Hoover 和 Schoenbach [S&P 2025] 提出的猜想。\n- 理想安全性:我们将理想伪随机码定义为与理想功能不可区分的码,这一简单定义同时涵盖了伪随机性和鲁棒性两种性质。我们证明,在无需额外假设的情况下,任何针对单比特消息的自适应鲁棒伪随机码都可以通过自举(bootstrap)构造出具有线性信息率的理想伪随机码。\n- CCA 安全性:在编码密钥公开的设置中,我们类比 CCA 安全加密,定义了 CCA 安全伪随机码。我们证明,在随机预言机模型中,任何针对单比特消息的自适应鲁棒公钥伪随机码都可以用来构造具有线性信息率的 CCA 安全伪随机码。\n这些结果直接为生成式 AI 水印方案(如 Gunn、Zhao 和 Song(2024)提出的实用质量保持图像水印)提供了更强的鲁棒性保证。
英文摘要:
Pseudorandom codes are error-correcting codes with the property that no efficient adversary can distinguish encodings from uniformly random strings. They were recently introduced by Christ and Gunn [CRYPTO 2024] for the purpose of watermarking the outputs of randomized algorithms, such as generative AI models. Several constructions of pseudorandom codes have since been proposed, but none of them are robust to error channels that depend on previously seen codewords. This stronger kind of robustness is referred to as adaptive robustness, and it is important for meaningful applications to watermarking. In this work, we show the following. - Adaptive robustness: We show that the pseudorandom codes of Christ and Gunn are adaptively robust, resolving a conjecture posed by Cohen, Hoover, and Schoenbach [S&P 2025]. - Ideal security: We define an ideal pseudorandom code as one which is indistinguishable from the ideal functionality, capturing both the pseudorandomness and robustness properties in one simple definition. We show that any adaptively robust pseudorandom code for single-bit messages can be bootstrapped to build an ideal pseudorandom code with linear information rate, under no additional assumptions. - CCA security: In the setting where the encoding key is made public, we define a CCA-secure pseudorandom code in analogy with CCA-secure encryption. We show that any adaptively robust public-key pseudorandom code for single-bit messages can be used to build a CCA-secure pseudorandom code with linear information rate, in the random oracle model. These results immediately imply stronger robustness guarantees for generative AI watermarking schemes, such as the practical quality-preserving image watermarks of Gunn, Zhao, and Song (2024).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。