|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Soundness''' is a property of [[interactive proof system]]s that requires that no prover can make the verifier accept for a wrong statement <math>y \not\in L</math> except with some small probability. The upper bound of this probability is referred to as the soundness error of a proof system.
| | My name is Peggy and I am studying Occupational Therapy and Philosophy at Lodz / Poland.<br><br>Look at my website; [http://sunquestlivingmd.com football] |
| | |
| More formally, for every prover <math>(\tilde{\mathcal{P}})</math>, and every <math>y \not\in L</math>:
| |
| | |
| : <math>\Pr[(\perp,(\text{accept}))\gets (\tilde{\mathcal{P}})(y) \leftrightarrow (\mathcal{V})(y)] < 2^{-80}.</math>
| |
| | |
| The above definition uses the somewhat arbitrary soundness error 2<sup>−80</sup>.
| |
| As long as the soundness error is bounded by a polynomial fraction of the potential running time of the verifier (i.e. <math>\leq1/\mathrm{poly}(|y|)</math>), 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 <math>\ell</math> repetitions, a soundness error <math>\epsilon</math> will be reduced to <math>\epsilon^\ell</math>.<ref>{{citation|first=Oded|last=Goldreich|authorlink=Oded Goldreich|title=Zero-Knowledge twenty years after its invention|year=2002|id={{ECCC|2002|02|063}}}}.</ref>
| |
| | |
| ==See also==
| |
| * [[Interactive proof system]]
| |
| * [[Proof of knowledge]]
| |
| * [[Zero-knowledge proof]]
| |
| | |
| ==References==
| |
| <references/>
| |
| | |
| | |
| [[Category:Proof theory]]
| |
| | |
| | |
| {{Crypto-stub}}
| |
Latest revision as of 04:40, 7 December 2014
My name is Peggy and I am studying Occupational Therapy and Philosophy at Lodz / Poland.
Look at my website; football