.
size of the proof and the verifier’s work), we have to relax the soundness requirement to hold only against efficient (computationally bounded) provers. Such proof systems, introduced by Brassard, Chaum, and Crépeau, are called arguments, though by abuse of language, they are sometimes still called