Abstract
An -weak non-interactive zero knowledge (NIZK) argument has soundness error at most and zero-knowledge error at most . We show that as long as is hard in the worst case, the existence of an -weak NIZK proof or argument for with implies the existence of one-way functions. To obtain this result, we introduce and analyze a strong version of universal approximation that may be of independent interest.
As an application, we obtain NIZK amplification theorems based on very mild worst-case complexity assumptions. Specifically, [Bitansky-Geier, CRYPTO’24] showed that -weak NIZK proofs (with and constants such that ) can be amplified to make their errors negligible, but needed to assume the existence of one-way functions. Our results can be used to remove the additional one-way function assumption and obtain NIZK amplification theorems that are (almost) unconditional; only requiring the mild worst-case assumption that if , then .