Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
From MaRDI portal
Publication:1653085
DOI10.1007/978-3-319-78372-7_7zbMATH Open1415.94415OpenAlexW2794624029MaRDI QIDQ1653085FDOQ1653085
Authors: Pyrros Chaidos, Geoffroy Couteau 
Publication date: 17 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_7
Recommendations
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- New constructions of reusable designated-verifier NIZKs
- Designated-verifier pseudorandom generators, and their applications
- Reusable designated-verifier NIZKs for all NP from CDH
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (24)
- Theory of Cryptography
- Title not available (Why is that?)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Round-efficient anonymous password-authenticated key exchange protocol in the standard model
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- DVNIZK
- Non-interactive zero-knowledge functional proofs
- Title not available (Why is that?)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
- Witness authenticating NIZKs and applications
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
- Efficient NIZKs for algebraic sets
- Zero-knowledge arguments for subverted RSA groups
- Cryptography and Coding
- Optimally sound sigma protocols under DCRA
- Multi-theorem preprocessing NIZKs from lattices
- Compact designated verifier NIZKs from the CDH assumption without pairings
- FHE-based bootstrapping of designated-prover NIZK
- Fast public-key silent OT and more from constrained Naor-Reingold
- Designated-verifier pseudorandom generators, and their applications
- New constructions of reusable designated-verifier NIZKs
- Non-interactive keyed-verification anonymous credentials
- Universal Accumulators with Efficient Nonmembership Proofs
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
This page was built for publication: Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653085)
