Statistical zero-knowledge languages can be recognized in two rounds

Recommendations

On the power of statistical zero knowledge
On round optimal statistical zero knowledge arguments
scientific article; zbMATH DE number 4191106
A complete problem for statistical zero knowledge
On the relationship between statistical zero-knowledge and statistical randomized encodings
On the relationship between statistical zero-knowledge and statistical randomized encodings
Resettable statistical zero knowledge
On relationships between statistical zero-knowledge proofs
scientific article; zbMATH DE number 1256785
Statistical concurrent non-malleable zero knowledge

Cites work

scientific article; zbMATH DE number 4185024 (Why is no real title available?)
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Does co-NP have short interactive proofs ?
The Knowledge Complexity of Interactive Proof Systems
The knowledge complexity of interactive proof-systems
Universal classes of hash functions

Cited in

(35)

A language-dependent cryptographic primitive
General Properties of Quantum Zero-Knowledge Proofs
Weak Zero-Knowledge beyond the Black-Box Barrier
The Complexity of Zero Knowledge
Interactive and probabilistic proof-checking
Uniform generation of NP-witnesses using an NP-oracle
New limits to classical and quantum instance compression
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
Public-coin statistical zero-knowledge batch verification against malicious verifiers
Computational complexity and knowledge complexity (extended abstract)
On the complexity of computational problems regarding distributions
A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
On best-possible obfuscation
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
Does co-NP have short interactive proofs ?
Perfect Non-interactive Zero Knowledge for NP
scientific article; zbMATH DE number 4180787 (Why is no real title available?)
On the power of many one-bit provers
On relationships between statistical zero-knowledge proofs
Practical proofs of knowledge without relying on theoretical proofs of membership on languages
An Equivalence Between Zero Knowledge and Commitments
Structure versus hardness through the obfuscation lens
Complexity classes of equivalence problems revisited
Statistical difference beyond the polarizing regime
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
A complete problem for statistical zero knowledge
Which languages have 4-round zero-knowledge proofs?
A framework for non-interactive instance-dependent commitment schemes (NIC)
On the relationship between statistical zero-knowledge and statistical randomized encodings
On the relationship between statistical zero-knowledge and statistical randomized encodings
Definitions and properties of zero-knowledge proof systems
Zero knowledge and circuit minimization
The graph clustering problem has a perfect zero-knowledge interactive proof
Resettable statistical zero knowledge
On the power of statistical zero knowledge

This page was built for publication: Statistical zero-knowledge languages can be recognized in two rounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808692)