Pages that link to "Item:Q808692"
From MaRDI portal
The following pages link to Statistical zero-knowledge languages can be recognized in two rounds (Q808692):
Displayed 29 items.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- On best-possible obfuscation (Q744349) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Definitions and properties of zero-knowledge proof systems (Q1324756) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)