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:

Date: received 11 Oct 2014

Contact author: alewko at cs columbia edu

Available format(s): PDF | BibTeX Citation

Version: 20141012:010224 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]