Public-coin statistical zero-knowledge batch verification against malicious verifiers
From MaRDI portal
Publication:2056790
DOI10.1007/978-3-030-77883-5_8OpenAlexW3151046115MaRDI QIDQ2056790FDOQ2056790
Authors: Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevanr 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_8
Cites Work
- Security proofs for signature schemes
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Impossibility of succinct quantum proofs for collision-freeness
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- New limits to classical and quantum instance compression
- The Knowledge Complexity of Interactive Proof Systems
- Statistical zero-knowledge languages can be recognized in two rounds
- A complete problem for statistical zero knowledge
- Advances in Cryptology - CRYPTO 2003
- Title not available (Why is that?)
- An Equivalence Between Zero Knowledge and Commitments
- Batch verification of short signatures
- On relationships between statistical zero-knowledge proofs
- Title not available (Why is that?)
- Pseudorandomness
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Zero knowledge with efficient provers
- On best-possible obfuscation
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- On the power of statistical zero knowledge
- Linear hash functions
- On the limits of nonapproximability of lattice problems
- Title not available (Why is that?)
- On basing private information retrieval on NP-hardness
- Limits of provable security for homomorphic encryption
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
- New (and old) proof systems for lattice problems
- On distributional collision resistant hashing
- Placing conditional disclosure of secrets in the communication complexity universe
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Batch verification for statistical zero knowledge proofs
- Fiat-Shamir: from practice to theory
- Balls and Bins: Smaller Hash Families and Faster Evaluation
Cited In (6)
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
- Non-interactive batch arguments for NP from standard assumptions
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Strong batching for non-interactive statistical zero-knowledge
- Publicly verifiable zero knowledge from (collapsing) blockchains
This page was built for publication: Public-coin statistical zero-knowledge batch verification against malicious verifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056790)
