From polynomial IOP and commitments to non-malleable zkSNARKs

DOI10.1007/978-3-031-48621-0_16MaRDI QIDQ6582227zbMATH OpenFDO

Authors Antonio Faonio, Dario Fiore, Markulf Kohlweiss, Luigi Russo, Michal Zajac

Publication date 2 August 2024

zbMATH Keywords

blockchain scalabilityknowledge-soundnessnon-interactive succinct zero-knowledge arguments of knowledge

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• Witness-succinct universally-composable SNARKs
• Prover-efficient commit-and-prove zero-knowledge snarks
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• Prover-efficient commit-and-prove zero-knowledge SNARKs

Cites work

• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• scientific article; zbMATH DE number 7650353 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Aggregatable subvector commitments for stateless cryptocurrencies
• Algebraic adversaries in the universal composability framework
• An algebraic framework for universal and updatable SNARKs
• Another look at extraction and randomization of Groth's zk-SNARK
• Aurora: transparent succinct arguments for R1CS
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient public-key cryptography in the presence of key leakage
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Interactive oracle proofs
• Leakage-resilient zero knowledge
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• On Signatures of Knowledge
• On the Non-malleability of the Fiat-Shamir Transform
• On the size of pairing-based non-interactive arguments
• Polynomial IOPs for linear algebra relations
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive proof composition from accumulation schemes
• Scalable zero knowledge with no trusted setup
• Short pairing-based non-interactive zero-knowledge arguments
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Spartan and bulletproofs are simulation-extractable (for free!)
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• The algebraic group model and its applications
• The knowledge complexity of interactive proof-systems
• Transparent SNARKs from DARK compilers
• Updatable and universal common reference strings with applications to zk-SNARKs
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• Witness-succinct universally-composable SNARKs
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments

Cited in

(1)

• Constant-size zk-SNARKs in ROM from falsifiable assumptions

This page was built for publication: From polynomial IOP and commitments to non-malleable zkSNARKs

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