Perfect NIZK with Adaptive Soundness
From MaRDI portal
Recommendations
Cited in
(25)- The hunting of the SNARK
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Statistical ZAPR arguments from bilinear maps
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Towards witness encryption without multilinear maps
- Succinct non-interactive arguments via linear interactive proofs
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Structure-preserving signatures and commitments to group elements
- On constant-round concurrent zero-knowledge from a knowledge assumption
- Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Efficient Traceable Signatures in the Standard Model
- Efficiency limitations for -protocols for group homomorphisms
- Perfect Non-interactive Zero Knowledge for NP
- Co-sound Zero-Knowledge with Public Keys
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Optimally sound sigma protocols under DCRA
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Triply adaptive UC NIZK
- Reverse firewalls for adaptively secure MPC without setup
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
- Efficient traceable signatures in the standard model
- Nikishin systems are perfect
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
This page was built for publication: Perfect NIZK with Adaptive Soundness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596375)