Public-coin statistical zero-knowledge batch verification against malicious verifiers
type: Item
instance of: scholarly article
title: Public-coin statistical zero-knowledge batch verification against malicious verifiers
DOI: 10.1007/978-3-030-77883-5_8
author: Inbar Kaslasi
author: Ron D. Rothblum
author: Prashant Nalini Vasudevanr
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440639
zbMATH Keywords: statistical zero-knowledge
zbMATH Keywords: batch verification
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 8
OpenAlex ID: W3151046115
cites work: Q3166192
cites work: Linear hash functions
cites work: Statistical zero-knowledge languages can be recognized in two rounds
cites work: New (and old) proof systems for lattice problems
cites work: Placing conditional disclosure of secrets in the communication complexity universe
cites work: On the Power of Statistical Zero Knowledge
cites work: From laconic zero-knowledge to public-key cryptography. Extended abstract
cites work: Q4249641
cites work: Limits of Provable Security for Homomorphic Encryption
cites work: Fiat-Shamir: from practice to theory
cites work: Batch verification of short signatures
cites work: Balls and Bins: Smaller Hash Families and Faster Evaluation
cites work: New Limits to Classical and Quantum Instance Compression
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: On the limits of nonapproximability of lattice problems
cites work: A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: On best-possible obfuscation
cites work: Q4542558
cites work: An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
cites work: Batch verification for statistical zero knowledge proofs
cites work: On distributional collision resistant hashing
cites work: On Basing Private Information Retrieval on NP-Hardness
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4365730
cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications
cites work: Zero knowledge with efficient provers
cites work: On relationships between statistical zero-knowledge proofs
cites work: An Equivalence Between Zero Knowledge and Commitments
cites work: Security Proofs for Signature Schemes
cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
cites work: A complete problem for statistical zero knowledge
cites work: Pseudorandomness
description: scientific article; zbMATH DE number 7440639