Welcome to the resource topic for 2014/827
Interactive Coding for Interactive Proofs
Authors: Yevgeniy Dodis, Allison Bishop LewkoAbstract:
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.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .