Compact designated verifier NIZKs from the CDH assumption without pairings

DOI10.1007/s00145-021-09408-wzbMath1479.94198OpenAlexW3200007074WikidataQ114692952 ScholiaQ114692952MaRDI QIDQ2051369

Shuichi Katsumata, Shota Yamada, Takashi Yamakawa, Ryo Nishimaki

Publication date: 24 November 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-021-09408-w

zbMATH Keywords

non-interactive zero-knowledgedesignated verifiercomputational Diffie-Hellman assumptionpairing-free groups

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

On the impossibility of algebraic NIZK in pairing-free groups

Uses Software

• DVNIZK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• The twin Diffie-Hellman problem and applications
• Definitions and properties of zero-knowledge proof systems
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Security arguments for digital signatures and blind signatures
• Certifying trapdoor permutations, revisited
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge
• From obfuscation to the security of Fiat-Shamir for proofs
• On the untapped potential of encoding predicates by arithmetic circuits and their applications
• Practical homomorphic message authenticators for arithmetic circuits
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• 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
• Non-interactive zero knowledge from sub-exponential DDH
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Towards non-interactive zero-knowledge for NP from LWE
• Designated-verifier pseudorandom generators, and their applications
• Reusable designated-verifier NIZKs for all NP from CDH
• Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
• Reusable non-interactive secure computation
• Exploring constructions of compact NIZKs from various assumptions
• New constructions of reusable designated-verifier NIZKs
• A forward-secure public-key encryption scheme
• Perfect Structure on the Edge of Chaos
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Functional Encryption with Bounded Collusions via Multi-party Computation
• Making Sigma-Protocols Non-interactive Without Random Oracles
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Short Non-interactive Zero-Knowledge Proofs
• Number-theoretic constructions of efficient pseudo-random functions
• Zero-Knowledge Proofs from Secure Multiparty Computation
• Co-sound Zero-Knowledge with Public Keys
• Log Depth Circuits for Division and Related Problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Group Signatures
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Nonmalleable Cryptography
• Foundations of Cryptography
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Fully homomorphic encryption using ideal lattices
• Fiat-Shamir: from practice to theory
• How to use indistinguishability obfuscation
• ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
• New Techniques for Noninteractive Zero-Knowledge
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Advances in Cryptology - CRYPTO 2003
• Zaps and Their Applications
• k-Times Anonymous Authentication (Extended Abstract)
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• Optimally Sound Sigma Protocols Under DCRA
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography
• Multi-theorem preprocessing NIZKs from lattices
• Adaptively secure MPC with sublinear communication complexity

This page was built for publication: Compact designated verifier NIZKs from the CDH assumption without pairings