The following pages link to Theory of Cryptography (Q5711671):
Displaying 10 items.
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- 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)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- On expected polynomial time simulation of zero knowledge protocols (Q3210167) (← links)
- (Q4434874) (← links)
- Black-box (and fast) non-malleable zero knowledge (Q6653055) (← links)
