Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
From MaRDI portal
Publication:6488375
DOI10.1007/978-3-030-90567-5_3zbMath1522.94028MaRDI QIDQ6488375
Behzad Abdolmaleki, Daniel Slamanig
Publication date: 13 April 2023
Cites Work
- Unnamed Item
- 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
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Key-and-argument-updatable QA-NIZKs
- UC-secure CRS generation for SNARKs
- Compactly Hiding Linear Spans
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- 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
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Smooth Projective Hashing for Conditionally Extractable Commitments
- 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
- Efficient Identity-Based Encryption Without Random Oracles
- 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
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More