Strong batching for non-interactive statistical zero-knowledge

DOI10.1007/978-3-031-58751-1_9MaRDI QIDQ6637570zbMATH OpenFDO

Authors Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58751-1_9

zbMATH Keywords

zero-knowledge proofsbatch verificationSZK

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Batch verification for statistical zero knowledge proofs
• Batch proofs of partial knowledge
• Non-interactive zero-knowledge proofs to multiple verifiers
• Batch verification and proofs of proximity with polylog overhead
• scientific article; zbMATH DE number 1418312

Cites work

• scientific article; zbMATH DE number 1775425 (Why is no real title available?)
• scientific article; zbMATH DE number 1418312 (Why is no real title available?)
• scientific article; zbMATH DE number 7250162 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Algebraic methods for interactive proof systems
• An Equivalence Between Zero Knowledge and Commitments
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Batch verification and proofs of proximity with polylog overhead
• Batch verification for statistical zero knowledge proofs
• Boosting batch arguments and RAM delegation
• Constant-round interactive proofs for delegating computation
• Correlation intractability and SNARGs from sub-exponential DDH
• IP = PSPACE
• Non-interactive batch arguments for NP from standard assumptions
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Noninteractive Zero-Knowledge
• On interactive proofs with a laconic prover
• On the Composition of Zero-Knowledge Proof Systems
• On the complexity of interactive proofs with bounded communication
• Pseudorandom generators for space-bounded computation
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• SNARGs for monotone policy batch NP
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
• Strong batching for non-interactive statistical zero-knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Zero knowledge with efficient provers

Cited in

(2)

• Strong batching for non-interactive statistical zero-knowledge
• Cryptography. Abstracts from the workshop held January 19--24, 2025

This page was built for publication: Strong batching for non-interactive statistical zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637570)