Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
From MaRDI portal
Publication:2149845
DOI10.1007/978-3-030-92548-2_26zbMath1502.94022OpenAlexW4206840767MaRDI QIDQ2149845
Behzad Abdolmaleki, Daniel Slamanig
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92548-2_26
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Improved (almost) tightly-secure simulation-sound QA-NIZK with applications
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- On subversion-resistant SNARKs
- Subversion-resistant simulation (knowledge) sound NIZKs
- 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
- Tightly CCA-Secure Encryption Without Pairings
- 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
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- 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
- Universally composable two-party and multi-party secure computation
- Perfect Non-interactive Zero Knowledge for NP
- The Knowledge Complexity of Interactive Proof Systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On QA-NIZK in the BPK Model
- QA-NIZK Arguments of Same Opening for Bilateral Commitments
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- 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
This page was built for publication: Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
