## Cryptology ePrint Archive: Report 2014/827

Interactive Coding for Interactive Proofs

Yevgeniy Dodis and Allison Bishop Lewko

Abstract: 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.

Category / Keywords: