Pages that link to "Item:Q557896"
From MaRDI portal
The following pages link to Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896):
Displaying 5 items.
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
- Foundations of Software Science and Computation Structures (Q5308472) (← links)
- Global Computing (Q5464840) (← links)
- Sound approximate and asymptotic probabilistic bisimulations for PCTL (Q6135748) (← links)