Zero-Knowledge Proofs of Generalized Regular Expression Matching for Anonymized Email Verification
Authors: Shreyas Londhe (ZK Email), Aayush Gupta (ZK Email), Sora Suegami (Ethereum Foundation), Yogesh Shahi (ZK Email), Rute Fgueiredo (ZK Email), Parisa Hassanizadeh (IPPT PAN / Zero Savvy), Shahriar Ebrahimi (The Alan Turing Institute / Zero Savvy)
Volume: 2026
Issue: 4
Pages: 740–771
DOI: https://doi.org/10.56553/popets-2026-0143
Abstract: Digital communication increasingly underpins identity, financial transactions, and regulatory compliance. In many settings, possession of a DKIM-signed email serves as evidence of account control, transaction confirmation, or institutional affiliation. Yet demonstrating such properties typically requires revealing the full email or relying on centralized intermediaries, introducing privacy risks and additional trust assumptions. A framework called ZK Email addresses this limitation by applying zero-knowledge proofs (ZKPs) to email verification, enabling publicly verifiable proofs of authenticity while preserving message confidentiality. However, its existing implementations struggle to support complex, real-world messages due to the inefficiency of regular-expression verification over structured formats and rich alphabets. We address this limitation with a new ZKP system for regex matching based on path verification over epsilon-free NFAs, yielding prover complexity linear in the captured path and independent of the original email's size. This approach enables practical validation of expressive standard structures required for full DKIM-signed email verification. To fully integrate our constructions into ZK Email, we design complete end-to-end ZK circuits that combine (i) DKIM signature verification, (ii) an arbitrary-length SHA-256 circuit with partial precomputation for rsa-sha256 under RFC~6376, and (iii) a general-purpose regex primitive enforcing structural constraints over email headers and body. We formalize the associated zero-knowledge relations and analyze their security under realistic adversary models. We implement the system~(fully integrated with ZK Email and released under the MIT license) in Circom and Noir, targeting Groth16 and UltraHonk backends, and evaluate it in both client-side and zkVM (SP1) deployment settings. Experimental results on a comodity hardware demonstrate substantial efficiency improvements over prior DFA-based approaches, achieving 2-6x in proving time using UltraHonk backend, while supporting a significantly richer class of regex languages.
Keywords: Zero-Knowledge Proofs, regular expression, Regex, Email, Provenance, zkSNARKs
Copyright in PoPETs articles are held by their authors. This article is published under a Creative Commons Attribution 4.0 license.
