Amplification of non-interactive zero knowledge, revisited

DOI10.1007/978-3-031-68400-5_11MaRDI QIDQ6653051

Nathan Geier, Nir Bitansky

Publication date: 13 December 2024

zbMATH Keywords

leakage simulation lemmanon-interactive zero-knowledge argument systems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Reusable designated-verifier NIZKs for all NP from CDH
• Simultaneous amplification: the case of non-interactive zero-knowledge
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• Key agreement from weak bit agreement
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Amplification of Chosen-Ciphertext Security
• A Parallel Repetition Theorem for Any Interactive Argument
• Advances in Cryptology - EUROCRYPT 2004
• On Robust Combiners for Oblivious Transfer and Other Primitives
• Oblivious-Transfer Amplification
• Degradation and Amplification of Computational Hardness
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• Topics in Cryptology – CT-RSA 2005
• A tight computational indistinguishability bound for product distributions

This page was built for publication: Amplification of non-interactive zero knowledge, revisited