We consider interactive proof systems over adversarial communication channels. We show that the seminal result that IP = PSPACE still holds when the communication channel is malicious, allowing even a constant fraction of the communication to be arbitrarily corrupted. ∗ Supported in part by NSF CNS 1413971 and NSF CCF 1423306. †