Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
Interactive Proof Systems A pair of interactive turing machines (P, V) is called an interactive proof system for language L if machine V is polynomial-time and the following two conditions hold: Completeness: For all (x,w) in the language L, the probability that a prover P can convince the honest