iO ⇒ Statistical ZK arguments for NP

Standard model · KMNPRY14

Statement

If an efficient indistinguishability obfuscator for all polynomial-size circuits exists, every language in $\mathbf{NP}$ has an interactive argument that is statistically zero-knowledge and computationally sound, with no further complexity assumption — KMNPRY14.

Notes

• One-way functions alone give the same arguments (OWF ⇒ Statistical ZK arguments for NP) — NOV06; iO gives one-way functions only under a complexity assumption such as $\mathbf{NP}⊈\mathbf{io}\text{-}\mathbf{BPP}$ (iO + NP ⊄ io-BPP ⇒ OWF) — KMNPRY14.