System of interactive proof

In Theory of complexity, a system of interactive proof is a abstract Machine which models an exchange of messages between two parties. These two parties, a prouvor and an inspector, communicate in order to dismount the fact that a character string belongs or not with a formal Language given. The prouvor has unlimited calculative resources while the inspector has limited resources. Both interact as a long time as it is necessary for the inspector to find an answer to the problem and to be convinced that it is the good one.

Two properties must be satisfied:

consistency ( completeness ): if the supplier of proof and the inspector follow the protocol then the inspector must always accept the proof
solidity ( soundness ): if the proposal is false, no supplier of malicious proof can convince an “honest” inspector that the proposal is true and this with a strong probability

NP

Protocols of Arthur-Merlin and Merlin-Arthur

Crush or face public or private

IP

MIP

PCP

See too

Random links: