Time-Optimal Interactive Proofs for Circuit Evaluation
- 1 January 2013
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
Other Versions
This publication has 30 references indexed in Scilit:
- Recursive composition and bootstrapping for SNARKS and proof-carrying dataPublished by Association for Computing Machinery (ACM) ,2013
- On the concrete efficiency of probabilistically-checkable proofsPublished by Association for Computing Machinery (ACM) ,2013
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problemsPublished by Association for Computing Machinery (ACM) ,2013
- Succinct Non-interactive Arguments via Linear Interactive ProofsLecture Notes in Computer Science, 2013
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back againPublished by Association for Computing Machinery (ACM) ,2012
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency BenefitsLecture Notes in Computer Science, 2012
- Memory DelegationLecture Notes in Computer Science, 2011
- Verifiable Delegation of Computation over Large DatasetsLecture Notes in Computer Science, 2011
- Homomorphic Signatures for Polynomial FunctionsLecture Notes in Computer Science, 2011
- Computational ComplexityPublished by Cambridge University Press (CUP) ,2009