Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge

DOI10.1007/978-3-319-78372-7_7MaRDI QIDQ1653085zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

zero-knowledge proofsnon-interactive proofs

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

Cited in

(24)

• Witness authenticating NIZKs and applications
• Universal Accumulators with Efficient Nonmembership Proofs
• scientific article; zbMATH DE number 6720551 (Why is no real title available?)
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Zero-knowledge arguments for subverted RSA groups
• FHE-based bootstrapping of designated-prover NIZK
• Non-interactive zero-knowledge functional proofs
• DVNIZK
• Designated-verifier pseudorandom generators, and their applications
• Optimally sound sigma protocols under DCRA
• New constructions of reusable designated-verifier NIZKs
• scientific article; zbMATH DE number 503349 (Why is no real title available?)
• Cryptography and Coding
• I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
• Fast public-key silent OT and more from constrained Naor-Reingold
• Theory of Cryptography
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Round-efficient anonymous password-authenticated key exchange protocol in the standard model
• Non-interactive keyed-verification anonymous credentials
• Multi-theorem preprocessing NIZKs from lattices
• Efficient NIZKs for algebraic sets
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting

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)