CRS-updatable asymmetric quasi-adaptive NIZK arguments

DOI10.1007/978-3-031-22912-1_1zbMath1519.94023OpenAlexW4313335107MaRDI QIDQ6169455

Behzad Abdolmaleki, Daniel Slamanig

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

non-interactive zero-knowledgecommon reference string model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
• A subversion-resistant SNARK
• Subversion-zero-knowledge SNARKs
• The algebraic group model and its applications
• On subversion-resistant SNARKs
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Key-and-argument-updatable QA-NIZKs
• An algebraic framework for universal and updatable SNARKs
• Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
• UC-secure CRS generation for SNARKs
• Shorter QA-NIZK and SPS with tighter security
• Shorter quadratic QA-NIZK proofs
• QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
• Compactly Hiding Linear Spans
• An Algebraic Framework for Diffie-Hellman Assumptions
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Square Span Programs with Applications to Succinct NIZK Arguments
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
• The Kernel Matrix Diffie-Hellman Assumption
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Perfect Non-interactive Zero Knowledge for NP
• The Knowledge Complexity of Interactive Proof Systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• On QA-NIZK in the BPK Model
• QA-NIZK Arguments of Same Opening for Bilateral Commitments
• A Unified Framework for Non-universal SNARKs
• Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
• 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
• Counting vampires: from univariate sumcheck to updatable ZK-SNARK
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• Snarky ceremonies

This page was built for publication: CRS-updatable asymmetric quasi-adaptive NIZK arguments