Pages that link to "Item:Q3210167"
From MaRDI portal
The following pages link to On expected polynomial time simulation of zero knowledge protocols (Q3210167):
Displaying 9 items.
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- Complexity bounds for zero-test algorithms (Q2457383) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Polynomial-Space Approximation of No-Signaling Provers (Q3587375) (← links)
- (Q4434874) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- Theory of Cryptography (Q5711671) (← links)