Interactive coding for interactive proofs

Allison Bishop, Yevgeniy Dodis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings
EditorsTal Malkin, Eyal Kushilevitz
PublisherSpringer Verlag
Pages352-366
Number of pages15
ISBN (Print)9783662490983
DOIs
StatePublished - 2016
Event13th International Conference on Theory of Cryptography, TCC 2016 - Tel Aviv, Israel
Duration: Jan 10 2016Jan 13 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9563
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Theory of Cryptography, TCC 2016
CountryIsrael
CityTel Aviv
Period1/10/161/13/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Interactive coding for interactive proofs'. Together they form a unique fingerprint.

  • Cite this

    Bishop, A., & Dodis, Y. (2016). Interactive coding for interactive proofs. In T. Malkin, & E. Kushilevitz (Eds.), Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings (pp. 352-366). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9563). Springer Verlag. https://doi.org/10.1007/978-3-662-49099-0_13