Ideal Pseudorandom Error-Correcting Codes with Applications to Watermarking Generative AI

Abstract:

Motivated by the growing need to identify AI-generated content, we ([CG24]) introduced a powerful new framework for generative AI watermarking. This framework leverages a new cryptographic primitive called a pseudorandom error-correcting code (PRC).

A PRC is an error-correcting code with the property that any polynomial number of codewords are pseudorandom to any efficient adversary. We construct PRCs from standard cryptographic assumptions, and in this talk I will give an overview of our construction from subexponential LPN. 

Since the introduction of PRCs, there has been a flurry of exciting works strengthening their properties and implementing them in practice. I will highlight new work with my collaborators ([AAC+25]) in which we define and construct a notion of an ideal PRC, with stronger robustness and pseudorandomness motivated by applications. Our proof of security uses tools from the analysis of Boolean functions. 

This is based on works with Sam Gunn, Omar Alrabiah, Prabhanjan Ananth, and Yevgeniy Dodis: [CG24] https://eprint.iacr.org/2024/235.pdf, [AAC+25] https://eprint.iacr.org/2024/1840

Bio:

Miranda Christ is a final-year Computer Science PhD student in the crypto lab and theory group at Columbia University, where she is co-advised by Tal Malkin and Mihalis Yannakakis. Her research focuses on practically motivated theoretical cryptography. Most recently she has been interested in using tools from cryptography to watermark AI-generated content.

Zoom info:

   Meeting ID: 945 5603 5878

   Password: 865039