The following pages link to Theory of Cryptography (Q5901780):
Displayed 18 items.
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Switched PIOA: parallel composition via distributed scheduling (Q854167) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← 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)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- Universally Composable Firewall Architectures Using Trusted Hardware (Q2947101) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- On the (Im-)Possibility of Extending Coin Toss (Q3593114) (← links)
- The Layered Games Framework for Specifications and Analysis of Security Protocols (Q5445502) (← links)
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (Q5505478) (← links)