Succinct non-subsequence arguments

DOI10.1007/978-3-031-71070-4_2MaRDI QIDQ6660378zbMATH OpenFDO

Authors San Ling, Khai Hanh Tang, Khu Vu, Huaxiong Wang, Yingfei Yan

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71070-4_2

zbMATH Keywords

lookupSNARKsumcheck

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Subvector commitments with application to succinct arguments
• Succinct non-interactive arguments via linear interactive proofs
• On subversion-resistant SNARKs
• The hunting of the SNARK
• On succinct non-interactive arguments in relativized worlds

Cites work

• Arya: nearly linear-time zero-knowledge proofs for correct program execution
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient KZG-based univariate sum-check and lookup argument
• Efficient string matching
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
• Mangrove: a scalable framework for folding-based SNARKs
• Nova: recursive zero-knowledge arguments from folding schemes
• Programming Techniques: Regular expression search algorithm
• Quadratic span programs and succinct NIZKs without PCPs
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• The knowledge complexity of interactive proof-systems
• Transparent SNARKs from DARK compilers
• Unlocking the lookup singularity with \textsf{Lasso}

This page was built for publication: Succinct non-subsequence arguments

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