Strong batching for non-interactive statistical zero-knowledge
type: Item
instance of: scholarly article
title: Strong batching for non-interactive statistical zero-knowledge
DOI: 10.1007/978-3-031-58751-1_9
author: Changrui Mu
author: Shafik Nassar
author: Ron D. Rothblum
author: Prashant Nalini Vasudevan
publication date: 2024-11-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7943483
zbMATH Keywords: batch verification
zbMATH Keywords: SZK
zbMATH Keywords: zero-knowledge proofs
MaRDI profile type: Publication
cites work: Noninteractive Zero-Knowledge
cites work: SNARGs for monotone policy batch NP
cites work: Non-interactive delegation and batch NP verification from standard computational assumptions
cites work: Correlation intractability and SNARGs from sub-exponential DDH
cites work: Non-interactive batch arguments for NP from standard assumptions
cites work: Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
cites work: On the complexity of interactive proofs with bounded communication
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Q4941874
cites work: Q4542558
cites work: On interactive proofs with a laconic prover
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: A Pseudorandom Generator from any One-way Function
cites work: Boosting batch arguments and RAM delegation
cites work: Somewhere statistical soundness, post-quantum security, and SNARGs
cites work: Batch verification for statistical zero knowledge proofs
cites work: Public-coin statistical zero-knowledge batch verification against malicious verifiers
cites work: Algebraic methods for interactive proof systems
cites work: Zero knowledge with efficient provers
cites work: Pseudorandom generators for space-bounded computation
cites work: An Equivalence Between Zero Knowledge and Commitments
cites work: Q5121910
cites work: Constant-Round Interactive Proofs for Delegating Computation
cites work: Batch verification and proofs of proximity with polylog overhead
cites work: IP = PSPACE
cites work: Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
description: scientific article; zbMATH DE number 7943483