Permutation argument via bases transformation

DOI10.1007/978-981-96-4734-7_9MaRDI QIDQ6897241zbMATH OpenFDO

Authors Yu Wang

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4734-7_9

zbMATH Keywords

permutation argumentpolynomial commitment schemeSNARK

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Algebraic methods for interactive proof systems
• Aurora: transparent succinct arguments for R1CS
• Brakedown: linear-time and field-agnostic SNARKs for R1CS
• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast Reed-Solomon interactive oracle proofs of proximity
• Gemini: elastic SNARKs for diverse environments
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Interactive oracle proofs
• Lattice-based succinct arguments for NP with polylogarithmic-time verification
• Libra: succinct zero-knowledge proofs with optimal prover computation
• On the power of multi-prover interactive protocols
• Probabilistic checking of proofs
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Structure-preserving signatures and commitments to group elements
• Time- and space-efficient arguments from groups of unknown order
• Transparent SNARKs from DARK compilers

This page was built for publication: Permutation argument via bases transformation

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