zkMaP: zero-knowledge succinct non-interactive matrix multiplication proofs

DOI10.62056/ANGY11FGXMaRDI QIDQ7390782zbMATH OpenFDO

Authors Biniyam Deressa, M. Anwar Hasan

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/ANGY11FGX

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• Constant-Size Commitments to Polynomials and Their Applications
• Definitions and properties of zero-knowledge proof systems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Linear Algebra with Sub-linear Zero-Knowledge Arguments
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On the size of pairing-based non-interactive arguments
• Short signatures from the Weil pairing
• SLAP: succinct lattice-based polynomial commitments from standard assumptions
• The algebraic group model and its applications
• Time-optimal interactive proofs for circuit evaluation

This page was built for publication: zkMaP: zero-knowledge succinct non-interactive matrix multiplication proofs

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