SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Authors:
- Alessandro ChiesaACAlessandro Chiesa
- Madars VirzaMVMadars Virza
Top Cited Papers
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 90-108
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Recursive composition and bootstrapping for SNARKS and proof-carrying data2013
- On the concrete efficiency of probabilistically-checkable proofs2013
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems2013
- Succinct Non-interactive Arguments via Linear Interactive Proofs2013
- Randomizable Proofs and Delegatable Anonymous Credentials2009
- FairplayMP2008
- P-signatures and Noninteractive Anonymous Credentials2008
- Checking computations in polylogarithmic time1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988