Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

126

TCC
2016
Springer

42views Cryptology» more TCC 2016»

Interactive Coding for Interactive Proofs

10 years 26 days ago

Interactive Coding for Interactive Proofs

Download cs.nyu.edu

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. ∗ Supported in part by NSF CNS 1413971 and NSF CCF 1423306. †

Allison Bishop, Yevgeniy Dodis

Real-time Traffic

Cryptology | TCC 2016 |

claim paper

Related Content

» Interactive and Probabilistic Proof of Mobile Code Safety

» Effective interactive proofs for higherorder imperative programs

» JProver Integrating ConnectionBased Theorem Proving into Interactive Proof Assistants

» Mobile Resource Guarantees for Smart Devices

» SourceLevel Proof Reconstruction for Interactive Theorem Proving

» Verification by Parallelization of Parametric Code

» Additive Proofs of Knowledge A New Notion for NonInteractive Proofs

» Mobile Resource Guarantees and Policies

» The Theorema Environment for Interactive Proof Development

» Principals in Programming Languages A Syntactic Proof Technique

Post Info
More Details (n/a)

Added	10 Apr 2016
Updated	10 Apr 2016
Type	Journal
Year	2016
Where	TCC
Authors	Allison Bishop, Yevgeniy Dodis

Comments (0)