Interactive Coding for Interactive Proofs

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. †

• Type: Journal
• Year: 2016
• Where: TCC
• Authors: Allison Bishop, Yevgeniy Dodis
• Keywords: Cryptology, TCC 2016