Updatable NIZKs from non-interactive zaps

DOI10.1007/978-3-031-20974-1_2zbMath1527.94018OpenAlexW4312251538MaRDI QIDQ6164392

Karim Baghery, Navid Ghaedi Bardeh

Publication date: 28 July 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20974-1_2

zbMATH Keywords

NIZKnon-interactive zap of knowledgenon-interactive zapssubversion ZKupdatable soundnessupdatable SRS model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the round complexity of OT extension
• Updatable and universal common reference strings with applications to zk-SNARKs
• Non-interactive zaps of knowledge
• A subversion-resistant SNARK
• Subversion-zero-knowledge SNARKs
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• An algebraic framework for universal and updatable SNARKs
• Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
• Subversion-resistant simulation (knowledge) sound NIZKs
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• The Knowledge Complexity of Interactive Proof Systems
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Advances in Cryptology – CRYPTO 2004
• Zaps and Their Applications
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• On the Size of Pairing-Based Non-interactive Arguments
• Non-interactive Zaps and New Techniques for NIZK
• 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

This page was built for publication: Updatable NIZKs from non-interactive zaps