You are looking at a specific version 20141012:010224 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- alewko @ cs columbia edu
- History
- 2014-10-12: received
- Short URL
- https://ia.cr/2014/827
- License
-
CC BY
