Designated-verifier pseudorandom generators, and their applications
From MaRDI portal
Publication:2292885
DOI10.1007/978-3-030-17656-3_20OpenAlexW2945149570MaRDI QIDQ2292885FDOQ2292885
Authors: Geoffroy Couteau, Dennis Hofheinz 
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_20
Recommendations
- New constructions of reusable designated-verifier NIZKs
- Reusable designated-verifier NIZKs for all NP from CDH
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
learning with errorscomputational Diffie-Hellmannon-interactive zero-knowledgeverifiable pseudorandom generators
Cited In (15)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Does Fiat-Shamir require a cryptographic hash function?
- Title not available (Why is that?)
- Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
- A note on non-interactive zero-knowledge from CDH
- Title not available (Why is that?)
- Multi-theorem preprocessing NIZKs from lattices
- Compact designated verifier NIZKs from the CDH assumption without pairings
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Fast public-key silent OT and more from constrained Naor-Reingold
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical ZAPs from group-based assumptions
This page was built for publication: Designated-verifier pseudorandom generators, and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292885)
