| Full text | Click to download. |
| Citation | Proceedings of ACM SIGPLAN and IFIP WG 1.7 4th Workshop on
Issues in the Theory of Security, April 2004
|
| Authors | Anupam Datta
Ralf Kusters John C. Mitchell Ajith Ramanathan Vitaly Shmatikov |
Several related research efforts have led to three different ways of specifying protocol security properties by simulation or equivalence. Abstracting the specification conditions away from the computational frameworks in which they have been previously applied, we show that when asynchronous communication is used, universal composability, black-box simulatability, and process equivalence express the same properties of a protocol. Further, the equivalence between these conditions holds for any computational framework, such as process calculus, that satisfies certain structural properties. Similar but slightly weaker results are achieved for synchronous communication.