Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
From MaRDI portal
Publication:2061955
DOI10.1007/978-3-030-75248-4_8zbMath1479.94170OpenAlexW3096738897MaRDI QIDQ2061955
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_8
transformationlatticessoundnessone-way permutationstatistical zero-knowledgedual-mode commitmentsnon-interactive arguments
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Minimum disclosure proofs of knowledge
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- An efficient pairing-based shuffle argument
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Quisquis: a new design for anonymous cryptocurrencies
- Designated-verifier pseudorandom generators, and their applications
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
- Making Sigma-Protocols Non-interactive Without Random Oracles
- Leveled Fully Homomorphic Signatures from Standard Lattices
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Perfect Non-interactive Zero Knowledge for NP
- Perfect NIZK with Adaptive Soundness
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Fiat-Shamir: from practice to theory
- How to use indistinguishability obfuscation
- A Non-interactive Shuffle with Pairing Based Verifiability
- New Techniques for Noninteractive Zero-Knowledge
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
