Recursive composition and bootstrapping for SNARKS and proof-carrying data

@inproceedings{Bitansky2012RecursiveCA,
  title={Recursive composition and bootstrapping for SNARKS and proof-carrying data},
  author={Nir Bitansky and Ran Canetti and Alessandro Chiesa and Eran Tromer},
  booktitle={STOC},
  year={2012}
}
Succinct non-interactive arguments of knowledge (SNARKs) enable verifying NP statements with complexity that is essentially independent of that required for classical NP verification. In particular, they provide strong solutions to the problem of verifiably delegating computation. We construct the first fully-succinct publicly-verifiable SNARK. To do that, we first show how to "bootstrap" any SNARK that requires expensive preprocessing to obtain a SNARK that does not, while preserving public… CONTINUE READING
Highly Cited
This paper has 190 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 126 extracted citations

190 Citations

02040'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 190 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Universal Arguments and their Applications

SIAM J. Comput. • 2001
View 7 Excerpts
Highly Influenced

Quadratic Span Programs and Succinct NIZKs without PCPs

IACR Cryptology ePrint Archive • 2012
View 14 Excerpts
Highly Influenced

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

IACR Cryptology ePrint Archive • 2011
View 14 Excerpts
Highly Influenced

Secure Two-Party Computation with Low Communication

IACR Cryptology ePrint Archive • 2011
View 4 Excerpts
Highly Influenced

Computationally Sound Proofs

SIAM J. Comput. • 2000
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…