New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
From MaRDI portal
Publication:2055662
DOI10.1007/978-3-030-45727-3_14zbMath1479.94212OpenAlexW3013344698MaRDI QIDQ2055662
Benoît Libert, Hoeteck Wee, David J. Wu, Alain Passelègue
Publication date: 1 December 2021
Full work available at URL: https://hal.inria.fr/hal-02993608/file/DV-NIZK.pdf
Related Items
Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ NIZK from SNARGs ⋮ New and improved constructions for partially equivocable public key encryption ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Statistical ZAPs from group-based assumptions ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certifying trapdoor permutations, revisited
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Dual-mode NIZKs from obfuscation
- 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
- Trapdoor hash functions and their applications
- Reusable non-interactive secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Exploring constructions of compact NIZKs from various assumptions
- New constructions of reusable designated-verifier NIZKs
- Enhancements of trapdoor permutations
- Adaptively Secure Garbled Circuits from One-Way Functions
- An Algebraic Framework for Diffie-Hellman Assumptions
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Short Non-interactive Zero-Knowledge Proofs
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Perfect Non-interactive Zero Knowledge for NP
- Perfect NIZK with Adaptive Soundness
- Secure Hybrid Encryption from Weakened Key Encapsulation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Pseudorandom Generator from any One-way Function
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- How to use indistinguishability obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- New Techniques for Noninteractive Zero-Knowledge
- The Twin Diffie-Hellman Problem and Applications
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Theory of Cryptography
- Multi-theorem preprocessing NIZKs from lattices
