Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
From MaRDI portal
Recommendations
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Reusable designated-verifier NIZKs for all NP from CDH
- Exploring constructions of compact NIZKs from various assumptions
- New constructions of reusable designated-verifier NIZKs
- Designated-verifier pseudorandom generators, and their applications
Cited in
(29)- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Compact NIZKs from standard assumptions on bilinear maps
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- FHE-based bootstrapping of designated-prover NIZK
- Non-interactive zero knowledge from sub-exponential DDH
- New constructions of hinting PRGs, OWFs with encryption, and more
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Does Fiat-Shamir require a cryptographic hash function?
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Designated-verifier pseudorandom generators, and their applications
- Reusable designated-verifier NIZKs for all NP from CDH
- Exploring constructions of compact NIZKs from various assumptions
- New constructions of reusable designated-verifier NIZKs
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Statistical ZAPs from group-based assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Multi-theorem preprocessing NIZKs from lattices
- Fine-grained verifier NIZK and its applications
- NIZK from SNARGs
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- A note on non-interactive zero-knowledge from CDH
- Compact NIZKs from standard assumptions on bilinear maps
- Chainable functional commitments for unbounded-depth circuits
- Fast public-key silent OT and more from constrained Naor-Reingold
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Rate-1 statistical non-interactive zero-knowledge
- Malicious homomorphic secret sharing with applications to DV-NIZK and more
This page was built for publication: Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292887)
