Pages that link to "Item:Q1261018"
From MaRDI portal
The following pages link to A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018):
Displayed 8 items.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- (Q5092454) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)