OWF ⇒ Statistical ZK arguments for NP

Standard model · NOV06 · security loss: polynomial

Statement

If one-way functions exist, every language in $\mathbf{NP}$ has an interactive argument that is statistically zero-knowledge and computationally sound — NOV06.

Notes

• Statistically hiding commitments from one-way functions followed — HR07 — and give the same arguments through statistically hiding COM ⇒ statistical ZK arguments — BCC88.
• Computational zero-knowledge proofs for $\mathbf{NP}$ follow from one-way functions as well (OWF ⇒ ZKP) — GMW91.