Benchmarking the setup of updatable zk-SNARKs
From MaRDI portal
Publication:6619946
DOI10.1007/978-3-031-44469-2_19zbMath1547.94312MaRDI QIDQ6619946
Mahdi Sedaghat, Karim Baghery, Axel Mertens
Publication date: 16 October 2024
Related Items (1)
Cites Work
- Unnamed Item
- On the round complexity of OT extension
- Updatable and universal common reference strings with applications to zk-SNARKs
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- UC-secure CRS generation for SNARKs
- Subversion-resistant simulation (knowledge) sound NIZKs
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Constant-Size Commitments to Polynomials and Their Applications
- How to Hash into Elliptic Curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- A Unified Framework for Non-universal SNARKs
- On the Size of Pairing-Based Non-interactive Arguments
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Snarky ceremonies
- Updatable NIZKs from non-interactive zaps
This page was built for publication: Benchmarking the setup of updatable zk-SNARKs
