"Practical IP" <= MA

Interactive protocols [GMR] and Arthur-Merlin games [B] have attracted considerable interest since their introduction a few years ago. These notions make it (probably) possible to extend the concept of what is “efficiently” provabk to include, for instance, graph non-isomorphism [GMW]. In this short note, we assume that the reader is familiar with interactive protocols, Arthur-Merlin games, and the notion: of zero-knowledge [GMR].

[1]  Lance Fortnow,et al.  The Complexity of Perfect Zero-Knowledge , 1987, Proceeding Structure in Complexity Theory.

[2]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[3]  David Chaum,et al.  Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..

[4]  Silvio Micali,et al.  Everything Provable is Provable in Zero-Knowledge , 1990, CRYPTO.

[5]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[7]  Martín Abadi,et al.  On Generating Solved Instances of Computational Problems , 1988, CRYPTO.

[8]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[9]  Moti Yung,et al.  Direct Minimum-Knowledge Computations , 1987, CRYPTO.

[10]  Gilles Brassard,et al.  Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).