Pages that link to "Item:Q2392095"
From MaRDI portal
The following pages link to Polynomial runtime and composability (Q2392095):
Displaying 12 items.
- Self-correcting polynomial programs (Q1916988) (← links)
- MoSS: modular security specifications framework (Q2128988) (← links)
- Embedding the UC model into the IITM model (Q2170048) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- Ideal Key Derivation and Encryption in Simulation-Based Security (Q3073705) (← links)
- (Q4008736) (← links)
- Run-time type computations in the Warren Abstract machine (Q4285642) (← links)
- (Q4841308) (← links)