A Note on Non-Interactive Zero-Knowledge from CDH

ePrint Report: A Note on Non-Interactive Zero-Knowledge from CDH

Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, Willy Quach

We build non-interactive zero-knowledge (NIZK) and ZAP arguments for all $\mathsf{NP}$ where soundness holds for infinitely-many security parameters, and against uniform adversaries, assuming the subexponential hardness of the Computational Diffie-Hellman (CDH) assumption. We additionally prove the existence of NIZK arguments with these same properties assuming the polynomial hardness of both CDH and the Learning Parity with Noise (LPN) assumption. In both cases, the …

adversaries build computational diffie eprint report hellman knowledge non prove report security zap