Amplification of non-interactive zero knowledge, revisited
From MaRDI portal
Recommendations
Cites work
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
- A Parallel Repetition Theorem for Any Interactive Argument
- A tight computational indistinguishability bound for product distributions
- Advances in Cryptology - EUROCRYPT 2004
- Amplification of Chosen-Ciphertext Security
- Degradation and Amplification of Computational Hardness
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- Key agreement from weak bit agreement
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Oblivious-Transfer Amplification
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
- Reusable designated-verifier NIZKs for all NP from CDH
- Simultaneous amplification: the case of non-interactive zero-knowledge
- Topics in Cryptology – CT-RSA 2005
- Unconditional Characterizations of Non-interactive Zero-Knowledge
Cited in
(3)
This page was built for publication: Amplification of non-interactive zero knowledge, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653051)