Doubly-Efficient zkSNARKs Without Trusted Setup
By Riad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler, Michael Walfish. 2018
362 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Program Analysis & Verification, Privacy & Security
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Martin Jaggi
- Qiang Yang
- Srinath T. V. Setty
- Peter Kairouz
- Jakub Konecný
- Dan Boneh
- Peter Richtárik
- Ananda Theertha Suresh
In Computational Theory and Mathematics
- Srinath T. V. Setty
- Dan Boneh
- Eli Ben-Sasson
- Michael Riabzev
- Iddo Bentov
- Henry Corrigan-Gibbs
- Yinon Horesh
- Yuval Ishai
In Program Analysis & Verification
- Srinath T. V. Setty
- Eli Ben-Sasson
- Dan Boneh
- Michael Riabzev
- Charalampos Papamanthou
- Henry Corrigan-Gibbs
- Iddo Bentov
- Yinon Horesh
In Privacy & Security
- Peter Kairouz
- Srinath T. V. Setty
- Badih Ghazi
- Rasmus Pagh
- Dan Boneh
- Qiang Yang
- Adrià Gascón
- H. Brendan McMahan
Citations in the corpus
- Advances and Open Problems in Federated Learning (2019, background): “If we relax the requirements for succinctness or non-interactiveness for the construction, there is a large body of constructions that achieve a wide range of efficiency trade-offs, avoid the trusted setup requirement and use more standard cryptographic assumptions [84, 397, 23, 58].”
- Scalable, transparent, and post-quantum secure computational integrity (2018, background): “For comparison, the Ligero verifier reaches 50 seconds for a circuit with ≈ 224 gates [1, Figure 1] and the Hyrax prover reaches ≈ 10 seconds for a circuit with ≈ 228 gates; BCCGP and BulletProofs require even greater running time [109, Figure 4.”
- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “Schemes such as libSTARK [9], zkVSQL [48] and Hyrax [47] also have such property.”
- Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019, background): “depend on secret values that must be deleted for the security of the system [106], [117].”
- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, methodology): “IOP of proximity [16,17] Point Point Fully linear IOP Linear Linear This paper, Hyrax [85], vSQL [87,88]”
- Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, methodology): “[91], Spartan offers an alternative to Libra [93], a zkSNARK that does not require a per-circuit trusted setup (instead, the trusted setup is for the polynomial commitment scheme); we refer to this variant as Spartankoe.”
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, methodology): “Hyrax [61] is a zero-knowledge protocol that processes circuits using a sum-check protocol originally introduced from the verifiable computation scheme by Goldwasser et al [43] and improved by Cormode et al.”