scientific article; zbMATH DE number 1418312
From MaRDI portal
Publication:4941874
Recommendations
Cited in
(36)- Trading help for interaction in statistical zero-knowledge proofs
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs
- Statistical difference beyond the polarizing regime
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- The complexity of estimating min-entropy
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- On the complexity of computational problems regarding distributions
- Minimum circuit size, graph isomorphism, and related problems
- A complete problem for statistical zero knowledge
- Perfect Non-interactive Zero Knowledge for NP
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- scientific article; zbMATH DE number 1241395 (Why is no real title available?)
- scientific article; zbMATH DE number 1256785 (Why is no real title available?)
- Minimum circuit size, graph isomorphism, and related problems
- Communication complexity of statistical distance
- Brief announcement: Zero-knowledge protocols for search problems
- Super-Perfect Zero-Knowledge Proofs
- On the power of statistical zero knowledge
- scientific article; zbMATH DE number 7250163 (Why is no real title available?)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge
- An Equivalence Between Zero Knowledge and Commitments
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- The Complexity of Zero Knowledge
- Public-key encryption from homogeneous CLWE
- Certified randomness from quantum supremacy
- Kolmogorov complexity characterizes statistical zero knowledge
- Strong batching for non-interactive statistical zero-knowledge
- Consequences of randomized reductions from SAT to time-bounded Kolmogorov complexity
- Doubly-efficient batch verification in statistical zero-knowledge
- Robustness for space-bounded statistical zero knowledge
- Total variation distance for product distributions is \(\#\mathsf{P}\)-complete
- Kolmogorov complexity characterizes statistical zero knowledge
- SZK proofs for black-box group problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941874)
