zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs

DOI10.1007/978-3-031-71070-4_3MaRDI QIDQ6660380zbMATH OpenFDO

Authors Jens Ernstberger, Stefanos Chaliasos, George Kadianakis, Sebastian Steinhorst, Philipp Jovanovic, Arthur Gervais, Benjamin Livshits, Michele Orrù

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71070-4_3

zbMATH Keywords

succinct non-interactive arguments of knowledgezero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Benchmarking the setup of updatable zk-SNARKs
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• Scalable zero knowledge via cycles of elliptic curves

Cites work

• \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Benchmarking the setup of updatable zk-SNARKs
• Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
• Elliptic curves. Number theory and cryptography
• Extended tower number field sieve: a new complexity for the medium prime case
• Fully homomorphic message authenticators
• Gemini: elastic SNARKs for diverse environments
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• Pairing-Friendly Elliptic Curves of Prime Order
• Pairings for cryptographers
• Plumo: an ultralight blockchain client
• Scalable zero knowledge with no trusted setup
• Snarks for C: verifying program executions succinctly and in zero knowledge
• The hunting of the SNARK
• The knowledge complexity of interactive proof-systems
• Updating key size estimations for pairings

This page was built for publication: zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660380)