Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions

DOI10.1007/978-3-030-17656-3_22MaRDI QIDQ2292887zbMATH OpenOpenAlexFDO

Authors Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17656-3_22

zbMATH Keywords

non-interactive zero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

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

(28)

• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• Toward non-interactive zero-knowledge proofs for NP from LWE
• Chainable functional commitments for unbounded-depth circuits
• Compact NIZKs from standard assumptions on bilinear maps
• Multi-theorem preprocessing NIZKs from lattices
• Does Fiat-Shamir require a cryptographic hash function?
• Fine-grained verifier NIZK and its applications
• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• Additive-homomorphic functional commitments and applications to homomorphic signatures
• A note on non-interactive zero-knowledge from CDH
• 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
• FHE-based bootstrapping of designated-prover NIZK
• Non-interactive zero knowledge from sub-exponential DDH
• Rate-1 statistical non-interactive zero-knowledge
• Multi-theorem preprocessing NIZKs from lattices
• Fast public-key silent OT and more from constrained Naor-Reingold
• 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
• Dual-mode NIZKs: possibility and impossibility results for property transfer
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• Fully-succinct multi-key homomorphic signatures from standard assumptions
• Statistical ZAPs from group-based assumptions
• NIZK from SNARGs
• New constructions of hinting PRGs, OWFs with encryption, 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)