UC-secure CRS generation for SNARKs

DOI10.1007/978-3-030-23696-0_6zbMATH Open1454.94036OpenAlexW2955087174MaRDI QIDQ2177622FDOQ2177622

Authors: Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac 

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23696-0_6

Recommendations

• Updatable and universal common reference strings with applications to zk-SNARKs
• A subversion-resistant SNARK
• On subversion-resistant SNARKs
• Snarky ceremonies
• Mining for privacy: how to bootstrap a snarky blockchain

zbMATH Keywords

SNARKCRS modelUC securitysubversion-security

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (15)

• Snarky ceremonies
• SnarkPack: practical SNARK aggregation
• Towards overcoming the undercutting problem
• CRS-updatable asymmetric quasi-adaptive NIZK arguments
• Another look at extraction and randomization of Groth's zk-SNARK
• On the efficiency of privacy-preserving smart contract systems
• Witness-succinct universally-composable SNARKs
• Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
• Benchmarking the setup of updatable zk-SNARKs
• On succinct non-interactive arguments in relativized worlds
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• Towards accountability in CRS generation
• Mining for privacy: how to bootstrap a snarky blockchain
• Updatable and universal common reference strings with applications to zk-SNARKs
• Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More

This page was built for publication: UC-secure CRS generation for SNARKs

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