Computational soundness of equational theories (Tutorial)
Steve Kremer. Computational soundness of equational theories (Tutorial). In Revised Selected Papers from the 3rd Symposium on Trustworthy Global Computing (TGC'07), pp. 363–382, Lecture Notes in Computer Science 4912, Springer, Sophia-Antipolis, France, 2008. Invited tutorial.
doi:10.1007/978-3-540-78663-4
Download
Abstract
We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal result by Abadi and Rogaway and shortly discuss some of its extensions. Then we describe a general model for reasoning about the soundness of implementations of equational theories. We illustrate this model on several examples of computationally sound implementations of equational theories.
BibTeX
@inproceedings{Kremer-tgc07, abstract = {We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal result by Abadi and Rogaway and shortly discuss some of its extensions. Then we describe a general model for reasoning about the soundness of implementations of equational theories. We illustrate this model on several examples of computationally sound implementations of equational theories.}, address = {Sophia-Antipolis, France}, author = {Kremer, Steve}, booktitle = {{R}evised {S}elected {P}apers from the 3rd {S}ymposium on {T}rustworthy {G}lobal {C}omputing ({TGC}'07)}, DOI = {10.1007/978-3-540-78663-4}, editor = {Barthe, Gilles and Fournet, C{\'e}dric}, pages = {363-382}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Computational soundness of equational theories (Tutorial)}, volume = {4912}, year = {2008}, acronym = {{TGC}'07}, conf-year = {2007}, conf-month = nov, url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/Kremer-tgc07.pdf}, note = {Invited tutorial}, }