Another look at extraction and randomization of Groth's zk-SNARK
From MaRDI portal
Publication:2145409
DOI10.1007/978-3-662-64322-8_22zbMath1491.94036OpenAlexW3209656134MaRDI QIDQ2145409
Markulf Kohlweiss, Mikhail Volkhov, Karim Baghery, Janno Siim
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_22
Related Items (8)
Composition with knowledge assumptions ⋮ Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) ⋮ A Unified Framework for Non-universal SNARKs ⋮ Witness-succinct universally-composable SNARKs ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Snarky ceremonies ⋮ Impossibilities in succinct arguments: black-box extraction and more
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- An efficient pairing-based shuffle argument
- The algebraic group model and its applications
- On the efficiency of privacy-preserving smart contract systems
- On the Non-malleability of the Fiat-Shamir Transform
- Randomizable Proofs and Delegatable Anonymous Credentials
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- Elliptic Curve Cryptosystems
- Breaking RSA may not be equivalent to factoring
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: Another look at extraction and randomization of Groth's zk-SNARK
