Another look at extraction and randomization of Groth's zk-SNARK

DOI10.1007/978-3-662-64322-8_22zbMATH Open1491.94036OpenAlexW3209656134MaRDI QIDQ2145409FDOQ2145409

Authors: Karim Baghery, Markulf Kohlweiss, Janno Siim, Mikhail Volkhov 

Publication date: 17 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_22

Recommendations

• Simulation Extractable Versions of Groth’s zk-SNARK Revisited
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• UC-secure CRS generation for SNARKs
• On subversion-resistant SNARKs
• On the (in)security of SNARKs in the presence of oracles

zbMATH Keywords

simulation extractabilityUC securityzk-SNARKs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites Work

• Elliptic Curve Cryptosystems
• Breaking RSA may not be equivalent to factoring
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• On the Non-malleability of the Fiat-Shamir Transform
• Randomizable Proofs and Delegatable Anonymous Credentials
• Title not available (Why is that?)
• Perfect Non-interactive Zero Knowledge for NP
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Universally composable two-party and multi-party secure computation
• Quadratic span programs and succinct NIZKs without PCPs
• An efficient pairing-based shuffle argument
• The algebraic group model and its applications
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• On the size of pairing-based non-interactive arguments
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Title not available (Why is that?)
• On the efficiency of privacy-preserving smart contract systems
• Simulation Extractable Versions of Groth’s zk-SNARK Revisited

Cited In (14)

• A unified framework for non-universal SNARKs
• Simulation Extractable Versions of Groth’s zk-SNARK Revisited
• From polynomial IOP and commitments to non-malleable zkSNARKs
• How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
• Snarky ceremonies
• Composition with knowledge assumptions
• On the efficiency of privacy-preserving smart contract systems
• Spartan and bulletproofs are simulation-extractable (for free!)
• Witness-succinct universally-composable SNARKs
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• Impossibilities in succinct arguments: black-box extraction and more
• Vector commitments with proofs of smallness: short range proofs and more
• Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
• Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability

Uses Software

• GitHub

This page was built for publication: Another look at extraction and randomization of Groth's zk-SNARK

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