## zk-SNARK

swMATH ID: | 22495 |

Software Authors: | Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars |

Description: | Scalable zero knowledge via cycles of elliptic curves. Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptographic primitive, both in theory and in practical applications. Recently, much research has focused on achieving an additional property, {it succinctness}, requiring the proof to be very short and easy to verify. Such proof systems are known as {it zero-knowledge succinct non-interactive arguments of knowledge} (zk-SNARKs), and are desired when communication is expensive, or the verifier is computationally weak. Existing zk-SNARK implementations have severe scalability limitations, in terms of space complexity as a function of the size of the computation being proved (e.g., running time of the NP statement’s decision program). First, the size of the proving key is quasilinear in the upper bound on the computation size. Second, producing a proof requires “writing down” all intermediate values of the entire computation, and then conducting global operations such as FFTs. The bootstrapping technique of Bitansky et al. (STOC ’13), following Valiant (TCC ’08), offers an approach to scalability, by recursively composing proofs: proving statements about acceptance of the proof system’s own verifier (and correctness of the program’s latest step). Alas, recursive composition of known zk-SNARKs has never been realized in practice, due to enormous computational cost. Using new elliptic-curve cryptographic techniques, and methods for exploiting the proof systems’ field structure and nondeterminism, we achieve the first zk-SNARK implementation that practically achieves recursive proof composition. Our zk-SNARK implementation runs random-access machine programs and produces proofs of their correct execution, on today’s hardware, for any program running time. It takes constant time to generate the keys that support {it all} computation sizes. Subsequently, the proving process only incurs a constant multiplicative overhead compared to the original computation’s time, and an essentially-constant additive overhead in memory. Thus, our zk-SNARK implementation is the first to have a well-defined, albeit low, clock rate of “verified instructions per second”. |

Homepage: | https://link.springer.com/article/10.1007%2Fs00453-016-0221-0 |

Keywords: | computationally-sound proofs; proof-carrying data; zero knowledge; elliptic curves |

Related Software: | Pinocchio; SNARKs for C; Marlin; ADSNARK; GitHub; Geppetto; ECPP; SWIFFT; Halo2; libiop; SageMath; Magma; SiRiUS; Plutus; fhe; NTRU; ZKBoo; libsnark |

Cited in: | 15 Documents |

all
top 5

### Cited by 41 Authors

### Cited in 5 Serials

1 | SIAM Journal on Computing |

1 | Algorithmica |

1 | Journal of Cryptology |

1 | JSIAM Letters |

1 | SIAM Journal on Applied Algebra and Geometry |

### Cited in 4 Fields

14 | Information and communication theory, circuits (94-XX) |

7 | Computer science (68-XX) |

4 | Number theory (11-XX) |

3 | Algebraic geometry (14-XX) |