Competing-provers protocols for circuit evaluation

DOI10.4086/TOC.2014.V010A005MaRDI QIDQ3191608zbMATH OpenOpenAlexFDO

Authors Gillat Kol, Ran Raz

Publication date 6 October 2014

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2014.v010a005

zbMATH Keywords

complexity theorycommunication complexitydelegationcompeting provers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Network protocols (68M12)

Recommendations

• Competing provers protocols for circuit evaluation
• Time-optimal interactive proofs for circuit evaluation
• Delegating computation: interactive proofs for muggles
• Two protocols for delegation of computation
• Constant-round interactive proofs for delegating computation

Cites work

• Competing provers protocols for circuit evaluation

Cited in

(2)

• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
• Competing provers protocols for circuit evaluation

This page was built for publication: Competing-provers protocols for circuit evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191608)