Statistical Soundness

From zkstacks
Revision as of 08:42, 1 July 2020 by Srikar (talk | contribs) (Created page with "Soundness condition in a ZK protocol refers to the Prover's inability to convince the Verifier of an incorrect statement. In Statistical ZK, soundness holds even if the prov...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Soundness condition in a ZK protocol refers to the Prover's inability to convince the Verifier of an incorrect statement.

In Statistical ZK, soundness holds even if the prover has unbounded computational power.

Retrieved from "http://161.35.113.184/index.php?title=Statistical_Soundness&oldid=48"