Difference between revisions of "Statistical Soundness"
Jump to navigation
Jump to search
(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...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
Soundness condition in a ZK protocol refers to the Prover's inability to convince the Verifier of an incorrect statement. | 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. | + | In Statistical ZK, soundness holds even if the prover has unbounded computational power. This setup is known as a ZK-Proof for this reason (holds with probability 1 - negl(security parameter).) |
Latest revision as of 08:45, 1 July 2020
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 (holds with probability 1 - negl(security parameter).)
