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
PublisherSpringer Verlag
Pages352-366
Number of pages15
Volume9563
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Interactive Proofs
Communication Channels
Coding
Interactive Proof Systems
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bishop, A., & Dodis, Y. (2016). Interactive coding for interactive proofs. In Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings (Vol. 9563, 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

Interactive coding for interactive proofs. / Bishop, Allison; Dodis, Yevgeniy.

Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings. Vol. 9563 Springer Verlag, 2016. p. 352-366 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9563).

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

Bishop, A & Dodis, Y 2016, Interactive coding for interactive proofs. in Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings. vol. 9563, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9563, Springer Verlag, pp. 352-366, 13th International Conference on Theory of Cryptography, TCC 2016, Tel Aviv, Israel, 1/10/16. https://doi.org/10.1007/978-3-662-49099-0_13
Bishop A, Dodis Y. Interactive coding for interactive proofs. In Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings. Vol. 9563. Springer Verlag. 2016. p. 352-366. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-49099-0_13
Bishop, Allison ; Dodis, Yevgeniy. / Interactive coding for interactive proofs. Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings. Vol. 9563 Springer Verlag, 2016. pp. 352-366 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2f1cda679e874d1991721fbd17e244ea,
title = "Interactive coding for interactive proofs",
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.",
author = "Allison Bishop and Yevgeniy Dodis",
year = "2016",
doi = "10.1007/978-3-662-49099-0_13",
language = "English (US)",
isbn = "9783662490983",
volume = "9563",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "352--366",
booktitle = "Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings",

}

TY - GEN

T1 - Interactive coding for interactive proofs

AU - Bishop, Allison

AU - Dodis, Yevgeniy

PY - 2016

Y1 - 2016

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

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

UR - http://www.scopus.com/inward/record.url?scp=84954122861&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84954122861&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-49099-0_13

DO - 10.1007/978-3-662-49099-0_13

M3 - Conference contribution

AN - SCOPUS:84954122861

SN - 9783662490983

VL - 9563

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 352

EP - 366

BT - Theory of Cryptography - 3th International Conference, TCC 2016-A, Proceedings

PB - Springer Verlag

ER -