Statistical Soundness
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. This setup is known as a ZK-Proof for this reason (true no matter what!).
