Public-coin statistical zero-knowledge batch verification against malicious verifiers
From MaRDI portal
Publication:2056790
DOI10.1007/978-3-030-77883-5_8OpenAlexW3151046115MaRDI QIDQ2056790
Ron D. Rothblum, Inbar Kaslasi, Prashant Nalini Vasudevanr
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_8
Related Items (2)
Non-interactive batch arguments for NP from standard assumptions ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On best-possible obfuscation
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Statistical zero-knowledge languages can be recognized in two rounds
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- On the limits of nonapproximability of lattice problems
- 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
- Batch verification of short signatures
- On relationships between statistical zero-knowledge proofs
- 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
- On Basing Private Information Retrieval on NP-Hardness
- Limits of Provable Security for Homomorphic Encryption
- Pseudorandomness
- Security Proofs for Signature Schemes
- Zero knowledge with efficient provers
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Linear hash functions
- New Limits to Classical and Quantum Instance Compression
- A complete problem for statistical zero knowledge
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- On the Power of Statistical Zero Knowledge
- Fiat-Shamir: from practice to theory
- Advances in Cryptology - CRYPTO 2003
- An Equivalence Between Zero Knowledge and Commitments
- Balls and Bins: Smaller Hash Families and Faster Evaluation
This page was built for publication: Public-coin statistical zero-knowledge batch verification against malicious verifiers
