Amplification of non-interactive zero knowledge, revisited
type: Item
instance of: scholarly article
title: Amplification of non-interactive zero knowledge, revisited
DOI: 10.1007/978-3-031-68400-5_11
author: Nir Bitansky
author: Nathan Geier
publication date: 2024-12-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7958306
zbMATH Keywords: non-interactive zero-knowledge argument systems
zbMATH Keywords: leakage simulation lemma
MaRDI profile type: Publication
cites work: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
cites work: Q4230367
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: A tight computational indistinguishability bound for product distributions
cites work: Simultaneous amplification: the case of non-interactive zero-knowledge
cites work: A Parallel Repetition Theorem for Any Interactive Argument
cites work: Degradation and Amplification of Computational Hardness
cites work: On Robust Combiners for Oblivious Transfer and Other Primitives
cites work: Topics in Cryptology – CT-RSA 2005
cites work: Key agreement from weak bit agreement
cites work: Q3549593
cites work: Amplification of Chosen-Ciphertext Security
cites work: A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
cites work: Unconditional Characterizations of Non-interactive Zero-Knowledge
cites work: Reusable designated-verifier NIZKs for all NP from CDH
cites work: Oblivious-Transfer Amplification
description: scientific article; zbMATH DE number 7958306