Soundness (interactive proof)

Soundness is a property of interactive proof systems that requires that no prover can make the verifier accept for a wrong statement $y \not\in L$ except with some small probability. The upper bound of this probability is referred to as the soundness error of a proof system.

More formally, for every prover ${\displaystyle ({\tilde {\mathcal {P}}})}$, and every $y \not\in L$:

${\displaystyle \Pr[(\perp ,({\text{accept}}))\gets ({\tilde {\mathcal {P}}})(y)\leftrightarrow ({\mathcal {V}})(y)]<2^{-80}.}$

The above definition uses the somewhat arbitrary soundness error 2⁻⁸⁰. As long as the soundness error is bounded by a polynomial fraction of the potential running time of the verifier (i.e. ${\displaystyle \leq 1/\mathrm {poly} (|y|)}$), it is always possible to amplify soundness until the soundness error becomes negligible relative to the running time of the verifier. This is achieved by repeating the proof and accepting only if all proofs verify. After $\ell$ repetitions, a soundness error $\epsilon$ will be reduced to ${\displaystyle \epsilon ^{\ell }}$.^[1]

See also

• Interactive proof system
• Proof of knowledge
• Zero-knowledge proof

References

1. Goldreich, Oded (2002), Zero-Knowledge twenty years after its invention, ECCC TR02-063.