The following pages link to CONCUR 2003 - Concurrency Theory (Q5900575):
Displaying 12 items.
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
- Task-structured probabilistic I/O automata (Q1745718) (← links)
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules (Q1887729) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Simulation and analysis of cryptographic protocols (Q2765456) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- A process algebra for reasoning about quantum security (Q2864166) (← links)
- (Q4434874) (← links)
- (Q4493893) (← links)
- (Q5146080) (← links)