Unlocking the lookup singularity with \textsf{Lasso}

DOI10.1007/978-3-031-58751-1_7MaRDI QIDQ6637567zbMATH OpenFDO

Authors Srinath Setty, Justin Thaler, Riad S. Wahby

Publication date 13 November 2024

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

zbMATH Keywords

lookup singularityzero-knowledge succinct non-interactive argument of knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• \textsf{Jolt}: SNARKs for virtual machines via lookups
• Ligero: lightweight sublinear arguments without a trusted setup
• Prover-efficient commit-and-prove zero-knowledge SNARKs
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency

Cites work

• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• 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
• Orion: zero knowledge proof with linear prover time
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Time-optimal interactive proofs for circuit evaluation
• Transparent SNARKs from DARK compilers
• Twisted tabulation hashing

Cited in

(23)

• \textsf{Jolt}: SNARKs for virtual machines via lookups
• HyperNova: recursive arguments for customizable constraint systems
• Succinct non-subsequence arguments
• Verifiable computation for approximate homomorphic encryption schemes
• On knowledge-soundness of Plonk in ROM from falsifiable assumptions
• Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
• How to prove false statements: practical attacks on Fiat-Shamir
• The complexity of memory checking with covert security
• SNARKs for virtual machines are non-malleable
• Blaze: fast SNARKs from interleaved RAA codes
• Succinct arguments over towers of binary fields
• FLI: folding lookup instances
• Natively compatible super-efficient lookup arguments and how to apply them
• Scalable zkSNARKs for matrix computations. A generic framework for verifiable deep learning
• \textsf{FREPack}: improved SNARK frontend for highly repetitive computations
• SNARK lower bounds via communication complexity
• Time-space trade-offs for sumcheck
• Soloist: distributed snark for R1CS with constant proof size
• Jagged polynomial commitments (or: How to stack multilinears)
• \textsf{Spectra}: interval-agnostic vector range argument for unstructured range assertions
• Ba\textit{loo}: algebraic lookup arguments
• Interstellar: efficient GKR-based IVC scheme with privacy-preserving collaborative folding
• General techniques for building SNARKs over the integers

This page was built for publication: Unlocking the lookup singularity with \textsf{Lasso}

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