Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
type: Item
instance of: scholarly article
title: Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
zbMATH Open document ID: 1479.94170
DOI: 10.1007/978-3-030-75248-4_8
author: Marc Fischlin
author: Felix Rohrbach
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450206
zbMATH Keywords: non-interactive arguments
zbMATH Keywords: statistical zero-knowledge
zbMATH Keywords: soundness
zbMATH Keywords: transformation
zbMATH Keywords: one-way permutation
zbMATH Keywords: lattices
zbMATH Keywords: dual-mode commitments
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 8
OpenAlex ID: W3096738897
cites work: Perfect NIZK with Adaptive Soundness
cites work: Q4228459
cites work: Dual-mode NIZKs: possibility and impossibility results for property transfer
cites work: Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Noninteractive Zero-Knowledge
cites work: Minimum disclosure proofs of knowledge
cites work: Fiat-Shamir: from practice to theory
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
cites work: Making Sigma-Protocols Non-interactive Without Random Oracles
cites work: Designated-verifier pseudorandom generators, and their applications
cites work: Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
cites work: An efficient pairing-based shuffle argument
cites work: Quisquis: a new design for anonymous cryptocurrencies
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Q3413440
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Leveled Fully Homomorphic Signatures from Standard Lattices
cites work: A Non-interactive Shuffle with Pairing Based Verifiability
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Simulation-sound arguments for LWE and applications to KDM-CCA2 security
cites work: New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
cites work: Unprovable security of perfect NIZK and non-interactive non-malleable commitments
cites work: Unconditional Characterizations of Non-interactive Zero-Knowledge
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: How to use indistinguishability obfuscation
description: scientific article; zbMATH DE number 7450206