Doubly-efficient batch verification in statistical zero-knowledge
From MaRDI portal
Cites work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A hierarchy theorem for interactive proofs of proximity
- A language-dependent cryptographic primitive
- An Equivalence Between Zero Knowledge and Commitments
- Batch verification and proofs of proximity with polylog overhead
- Batch verification for statistical zero knowledge proofs
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Constant-round interactive proofs for delegating computation
- Constant-round oblivious transfer in the bounded storage model
- Definitions and properties of zero-knowledge proof systems
- Delegating computation: interactive proofs for muggles
- scientific article; zbMATH DE number 1418312 (Why is no real title available?)
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Interactive proofs of proximity: delegating computation in sublinear time
- Noninteractive Zero-Knowledge
- On doubly-efficient interactive proof systems
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Zero knowledge with efficient provers
- Zero-knowledge proofs from secure multiparty computation
This page was built for publication: Doubly-efficient batch verification in statistical zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952840)
