Efficient Two-Prover Perfect Zero Knowledge Protocols for Recursively Enumerable Languages

Every language in the complexity class MIP*, which contains all recursively enumerable languages, has a two-prover one-round perfect zero knowledge interactive proof system.