Computational Soundness of Equational Theories (Tutorial)

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.

• Type: Conference
• Year: 2007
• Where: TGC
• Authors: Steve Kremer
• Keywords: Adaptive Adversaries, Applied Computing, Cryptographic Models, Equational Theories, TGC 2007