Interactive Coding For Interactive Proofs

IACR Cryptology ePrint Archive（2016）

引用 4|浏览42

暂无评分

摘要

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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要