The following pages link to (Q4493893):
Displaying 15 items.
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Automated verification of selected equivalences for security protocols (Q2474047) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Protocol composition logic (PCL) (Q2864155) (← links)
- Polynomial-Space Approximation of No-Signaling Provers (Q3587375) (← links)
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Q4917062) (← links)
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields (Q5056363) (← links)
- (Q5146080) (← links)
- Machine-Checked Security Proofs of Cryptographic Signature Schemes (Q5862663) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900575) (← links)
- (Q6062142) (← links)
