Public-coin statistical zero-knowledge batch verification against malicious verifiers

DOI10.1007/978-3-030-77883-5_8MaRDI QIDQ2056790zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

batch verificationstatistical zero-knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 1303126 (Why is no real title available?)
• scientific article; zbMATH DE number 1088905 (Why is no real title available?)
• scientific article; zbMATH DE number 1775425 (Why is no real title available?)
• A complete problem for statistical zero knowledge
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• Advances in Cryptology - CRYPTO 2003
• An Equivalence Between Zero Knowledge and Commitments
• An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
• Balls and Bins: Smaller Hash Families and Faster Evaluation
• Batch verification for statistical zero knowledge proofs
• Batch verification of short signatures
• Fiat-Shamir: from practice to theory
• From laconic zero-knowledge to public-key cryptography. Extended abstract
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Impossibility of succinct quantum proofs for collision-freeness
• Limits of provable security for homomorphic encryption
• Linear hash functions
• New (and old) proof systems for lattice problems
• New limits to classical and quantum instance compression
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• On basing private information retrieval on NP-hardness
• On best-possible obfuscation
• On distributional collision resistant hashing
• On relationships between statistical zero-knowledge proofs
• On the limits of nonapproximability of lattice problems
• On the power of statistical zero knowledge
• Placing conditional disclosure of secrets in the communication complexity universe
• Pseudorandomness
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Security proofs for signature schemes
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Statistical zero-knowledge languages can be recognized in two rounds
• The Knowledge Complexity of Interactive Proof Systems
• Zero knowledge with efficient provers

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)