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 12 items.
- A language-dependent cryptographic primitive (Q676829) (← 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)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← 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)