Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
that of a real interaction between the prover P and verifier V. That is, ∀(x,w)∈L, ∀V ∃S: Pr[ D⟨P(x,w),V(x)⟩ = 1 ] - Pr[ D⟨S(x)⟩ = 1 ] ≤ negl We first need to recall the very notion of computational indistinguishability to understand the simulation mechanism. Indistinguishability is a powerful