A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol
[chapter]
2004
Lecture Notes in Computer Science
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active attacks including concurrent protocol runs if it is implemented using provably secure cryptographic primitives. Although we achieve security under cryptographic definitions, our proof does not have to deal with probabilistic aspects of cryptography and is hence in the scope of current proof tools. The reason is that we
doi:10.1007/978-3-540-30108-0_6
fatcat:thj2rmeylvhjtklfeujtl37u3u