Pages that link to "Item:Q1021232"
From MaRDI portal
The following pages link to Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232):
Displaying 8 items.
- Expected-time cryptography: generic techniques and applications to concrete soundness (Q2119089) (← links)
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits (Q2267359) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- On expected polynomial time simulation of zero knowledge protocols (Q3210167) (← links)
- (Q4434874) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Theory of Cryptography (Q5711671) (← links)
- Rogue-instance security for batch knowledge proofs (Q6581786) (← links)