Competing provers protocols for circuit evaluation

DOI10.1145/2422436.2422487MaRDI QIDQ2986894zbMATH OpenOpenAlexFDO

Authors Gillat Kol, Ran Raz

Publication date 16 May 2017

Published in Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2422436.2422487

zbMATH Keywords

circuit lower boundcommunication complexitycompeting proversdelegating computationinteractive proofs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

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

Cites work

• A model of interactive teaching
• A theory of goal-oriented communication
• A theory of the learnable
• Algorithmic Learning Theory
• Derandomizing polynomial identity tests means proving circuit lower bounds
• scientific article; zbMATH DE number 3154781 (Why is no real title available?)
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• scientific article; zbMATH DE number 67631 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• Learning from different teachers
• Measuring teachability using variants of the teaching dimension
• Models of cooperative teaching and learning
• Occam's razor
• On specifying Boolean functions by labelled examples
• On the complexity of teaching
• On the limits of efficient teachability
• On the power of inductive inference from good examples
• Pseudorandom generators for space-bounded computation
• Recent Developments in Algorithmic Teaching
• Teachability in computational learning
• Teaching a smarter learner.
• Teaching Randomized Learners

Cited in

(4)

• Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn
• Competing-provers protocols for circuit evaluation
• Refereed delegation of computation
• Non-cooperative rational interactive proofs

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 Q2986894)