On relationships between statistical zero-knowledge proofs
From MaRDI portal
Publication:1975967
Recommendations
- scientific article; zbMATH DE number 1256785
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the power of statistical zero knowledge
- Advances in Cryptology - CRYPTO 2003
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- A complete problem for statistical zero knowledge
- scientific article; zbMATH DE number 7706036
- scientific article; zbMATH DE number 1088224
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Cites work
- Algebraic methods for interactive proof systems
- Computational complexity and knowledge complexity (extended abstract)
- Does co-NP have short interactive proofs ?
- scientific article; zbMATH DE number 1256785 (Why is no real title available?)
- scientific article; zbMATH DE number 1024048 (Why is no real title available?)
- scientific article; zbMATH DE number 1031002 (Why is no real title available?)
- scientific article; zbMATH DE number 1775425 (Why is no real title available?)
- scientific article; zbMATH DE number 1394298 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- IP = PSPACE
- Minimum disclosure proofs of knowledge
- Probability Inequalities for Sums of Bounded Random Variables
- Quantifying knowledge complexity
- Statistical zero-knowledge languages can be recognized in two rounds
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(51)- Definitions and properties of zero-knowledge proof systems
- Trading help for interaction in statistical zero-knowledge proofs
- An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
- Proofs of Work from worst-case assumptions
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Batch verification for statistical zero knowledge proofs
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
- The minimum oracle circuit size problem
- Knottedness is in NP, modulo GRH
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge
- Reduction zero-knowledge
- Computational complexity and knowledge complexity (extended abstract)
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Resettable statistical zero knowledge
- A Surprisingly Simple Way of Reversing Trace Distance via Entanglement
- Zero knowledge with efficient provers
- Composition of zero-knowledge proofs with efficient provers
- New limits to classical and quantum instance compression
- A complete problem for statistical zero knowledge
- Zero-Knowledge Simulation of Boolean Circuits
- scientific article; zbMATH DE number 1241395 (Why is no real title available?)
- scientific article; zbMATH DE number 1256785 (Why is no real title available?)
- scientific article; zbMATH DE number 1263223 (Why is no real title available?)
- scientific article; zbMATH DE number 1031002 (Why is no real title available?)
- scientific article; zbMATH DE number 1088225 (Why is no real title available?)
- scientific article; zbMATH DE number 1952908 (Why is no real title available?)
- scientific article; zbMATH DE number 1775425 (Why is no real title available?)
- Languages with efficient zero-knowledge PCPs are in SZK
- scientific article; zbMATH DE number 1418312 (Why is no real title available?)
- A framework for non-interactive instance-dependent commitment schemes (NIC)
- The Untold Story of $$\mathsf {SBP}$$
- On the power of statistical zero knowledge
- scientific article; zbMATH DE number 7250163 (Why is no real title available?)
- Zero Knowledge and Soundness Are Symmetric
- 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
- An Unconditional Study of Computational Zero Knowledge
- Advances in Cryptology - ASIACRYPT 2003
- On the complexity of compressing obfuscation
- Kolmogorov complexity characterizes statistical zero knowledge
- Robustness for space-bounded statistical zero knowledge
- Instance-hiding interactive proofs (extended abstract)
- Robustness for space-bounded statistical zero knowledge
- Instance-hiding interactive proofs
- On best-possible obfuscation
- Statistical zero-knowledge languages can be recognized in two rounds
- Relativized perfect zero knowledge is not BPP
This page was built for publication: On relationships between statistical zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975967)
