@inproceedings{JLM05,
title = { Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries },
author = {Janvier, Romain and Lakhnech, Yassine and Mazar\'e, Laurent},
year = {2005},
booktitle = {The European Symposium on Programming (ESOP'05). Edinburgh (Scotland)},
series = {LNCS},
volume = {3444},
team = {DCS},
abstract = {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 it seems to be a powerful tool for proving equivalences between security criteria. Also, the proof of this theorem uses original ideas that seem to be applicable in other situations.},
}
