Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
parties. The parties, known as prover P and verifier V, interact by exchanging messages in order to ascertain whether a statement is correct. The prover is all-powerful and possesses unlimited computational resources, but cannot be trusted, while the verifier has bounded computational power.