interactive proof system

in computational complexity theory, an abstract machine modeling computation as two parties (an untrusted but powerful ‘prover’; a trusted ‘verifier’ with bounded resources) exchanging messages to ascertain whether some string belongs to a language