The following pages link to Theory of Cryptography (Q5711669):
Displaying 11 items.
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Simulatable channels: extended security that is universally composable and easier to prove (Q1710688) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Improved Cryptographic Puzzle Based on Modular Exponentiation (Q3449412) (← links)
- Theory of Cryptography (Q5711659) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900576) (← links)
- Universal reductions: reductions relative to stateful oracles (Q6169554) (← links)
