Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
From MaRDI portal
Recommendations
- Fiat-Shamir: from practice to theory
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
- scientific article; zbMATH DE number 1775425
Cites work
- scientific article; zbMATH DE number 5081837 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- A Non-interactive Shuffle with Pairing Based Verifiability
- An efficient pairing-based shuffle argument
- Designated-verifier pseudorandom generators, and their applications
- Dual-mode NIZKs: possibility and impossibility results for property transfer
- Efficient culpably sound NIZK shuffle argument without random oracles
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- How to use indistinguishability obfuscation
- Leveled fully homomorphic signatures from standard lattices
- Making Sigma-protocols non-interactive without random oracles
- Minimum disclosure proofs of knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- New techniques for noninteractive zero-knowledge
- Noninteractive Zero-Knowledge
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- Perfect NIZK with Adaptive Soundness
- Perfect Non-interactive Zero Knowledge for NP
- Quisquis: a new design for anonymous cryptocurrencies
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- The Knowledge Complexity of Interactive Proof Systems
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
Cited in
(5)- Searching for ELFs in the cryptographic forest
- On the limits of non-interactive blind signatures
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Black-box non-interactive zero knowledge from vector trapdoor hash
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
This page was built for publication: Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061955)
