Interstellar: efficient GKR-based IVC scheme with privacy-preserving collaborative folding

DOI10.1007/978-3-032-26737-5_6MaRDI QIDQ7390881zbMATH OpenFDO

Authors Jieyi Long

Publication date 2026

Full work available at URL https://doi.org/10.1007/978-3-032-26737-5_6

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Algebraic reductions of knowledge
• Barycentric Lagrange Interpolation
• Delegating computation: interactive proofs for muggles
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Guaranteed output delivery comes free in honest majority MPC
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• HyperNova: recursive arguments for customizable constraint systems
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Libra: succinct zero-knowledge proofs with optimal prover computation
• MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
• Nova: recursive zero-knowledge arguments from folding schemes
• Proof-carrying data without succinct arguments
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Scalable zero knowledge via cycles of elliptic curves
• Unlocking the lookup singularity with \textsf{Lasso}

This page was built for publication: Interstellar: efficient GKR-based IVC scheme with privacy-preserving collaborative folding

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