\textsf{Jolt}: SNARKs for virtual machines via lookups

DOI10.1007/978-3-031-58751-1_1MaRDI QIDQ6637560zbMATH OpenFDO

Authors Arasu Arun, Srinath Setty, Justin Thaler

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58751-1_1

zbMATH Keywords

zero-knowledge virtual machinezkVM paradigm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge via cycles of elliptic curves
• Unlocking the lookup singularity with \textsf{Lasso}
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Snarks for C: verifying program executions succinctly and in zero knowledge

Cites work

• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Nova: recursive zero-knowledge arguments from folding schemes
• On the size of pairing-based non-interactive arguments
• Practical verified computation with streaming interactive proofs
• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge with no trusted setup
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Time-optimal interactive proofs for circuit evaluation

Cited in

(15)

• Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
• Unlocking the lookup singularity with \textsf{Lasso}
• Constraint-friendly map-to-elliptic-curve-group relations and their applications
• Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
• The complexity of memory checking with covert security
• \textsf{Polocolo}: a ZK-friendly hash function based on S-boxes using power residues
• SNARKs for virtual machines are non-malleable
• Blaze: fast SNARKs from interleaved RAA codes
• FLI: folding lookup instances
• Natively compatible super-efficient lookup arguments and how to apply them
• BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
• IVC in the open-and-sign random oracle model
• SNARK lower bounds via communication complexity
• HAPPIER: hash-based, aggregatable, practical post-quantum signatures implemented efficiently with Risc0
• Ba\textit{loo}: algebraic lookup arguments

This page was built for publication: \textsf{Jolt}: SNARKs for virtual machines via lookups

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