Simultaneous amplification: the case of non-interactive zero-knowledge
From MaRDI portal
Recommendations
- Non-interactive zero-knowledge proofs to multiple verifiers
- On the Amortized Complexity of Zero-Knowledge Protocols
- On the amortized complexity of zero-knowledge protocols
- scientific article; zbMATH DE number 7650378
- On the amortized complexity of zero knowledge protocols for multiplicative relations
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Concurrent zero knowledge, revisited
- Theory of Cryptography
- Theory of Cryptography
- Oblivious-Transfer Amplification
Cited in
(7)- Amplifying the security of functional encryption, unconditionally
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Amplification of non-interactive zero knowledge, revisited
- On weak NIZKs, one-way functions and amplification
- How to share an NP statement or combiners for zero-knowledge proofs
- NIZK amplification via leakage-resilient secure computation
- Robust non-interactive zero-knowledge combiners
This page was built for publication: Simultaneous amplification: the case of non-interactive zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304997)