NIZK proof for NP ⇒ NIZK argument for NP

Fully-black-box reduction · CRS model · folklore · security loss: none

Statement

A NIZK proof system for NP is a NIZK argument for NP: soundness against unbounded provers holds in particular against efficient ones — folklore.