The non-interactive analogue of SZKh.
Defined in [BG03], where the following was also shown:
The quantum lower bound for the set comparison problem in [Aar02] implies an oracle relative to which NISZKh is not in BQP.
The class of decision problems for which a "yes" answer can be verified by a statistical zero-knowledge proof protocol, and the prover and verifier both have access to a string computed by a trusted probabilistic polynomial-time third party with access to the input.
Defined in [BG03], where it was also shown that SZKh = SZK.
Contains NISZKh.