A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries
[chapter]
2005
Lecture Notes in Computer Science
In this paper, we extend previous results relating the Dolev-Yao model and the computational model. We add the possibility to exchange keys and consider cryptographic primitives such as signature. This work can be applied to check protocols in the computational model by using automatic verification tools in the formal model. To obtain this result, we introduce a precise definition for security criteria which leads to a nice reduction theorem. The reduction theorem is of interest on its own as
doi:10.1007/978-3-540-31987-0_13
fatcat:qwo4enitp5e5nlpg5vziokb37e