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

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

Cited in

(44)

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

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)