Pages that link to "Item:Q3524308"
From MaRDI portal
The following pages link to Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols (Q3524308):
Displaying 12 items.
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation (Q2210436) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- On the Security of Long-Lived Archiving Systems Based on the Evidence Record Syntax (Q2947064) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
