The following pages link to (Q5750398):
Displayed 12 items.
- Locally random reductions: Improvements and applications (Q676825) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Relativized perfect zero knowledge is not BPP (Q811120) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)