MuxProofs: succinct arguments for machine computation from vector lookups

DOI10.1007/978-981-96-0935-2_8MaRDI QIDQ6965217zbMATH OpenFDO

Authors Zijing Di, Lucas Xia, Wilson Nguyen, Nirvan Tyagi

Publication date 3 July 2025

Full work available at URL https://infoscience.epfl.ch/handle/20.500.14299/242693

zbMATH Keywords

machine computationvector lookupszero-knowledge proofs

Mathematics Subject Classification ID

Theory of data (68Pxx) Cryptography (94A60)

Cites work

• 1-out-of-n Signatures from a Variety of Keys
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Algebraic methods for interactive proof systems
• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Constant-Size Commitments to Polynomials and Their Applications
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Linear-size constant-query IOPs for delegating computation
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Nova: recursive zero-knowledge arguments from folding schemes
• On succinct non-interactive arguments in relativized worlds
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Orion: zero knowledge proof with linear prover time
• Proof-carrying data from arithmetized random oracles
• Proof-carrying data without succinct arguments
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Recursive proof composition from accumulation schemes
• Scalable zero knowledge via cycles of elliptic curves
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Stacked garbling for disjunctive zero-knowledge proofs
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Transparent SNARKs from DARK compilers

This page was built for publication: MuxProofs: succinct arguments for machine computation from vector lookups

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