From polynomial IOP and commitments to non-malleable zkSNARKs

DOI10.1007/978-3-031-48621-0_16zbMATH Open1544.94239MaRDI QIDQ6582227FDOQ6582227

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

Publication date: 2 August 2024

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

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)

Cites Work

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

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)