<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05256630</id>
  <dt>a</dt>
  <an>05256630</an>
  <augroup>
    <au>Kremer, Steve</au>
  </augroup>
  <ti>Computational soundness of equational theories. (Tutorial).</ti>
  <so>Barthe, Gilles (ed.) et al., Trustworthy global computing. Third symposium, TGC 2007, Sophia-Antipolis, France, November 5--6, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-78662-7/pbk). Lecture Notes in Computer Science 4912, 363-382 (2008).</so>
  <py>2008</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-78663-4_24</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>