Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

TGC
2007
Springer

favoriteEmaildiscussreport

107views Applied Computing» more TGC 2007»

Computational Soundness of Equational Theories (Tutorial)

14 years 5 months ago

Computational Soundness of Equational Theories (Tutorial)

Download www.lsv.ens-cachan.fr

Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We ﬁrst 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.

Steve Kremer

Real-time Traffic

Adaptive Adversaries | Applied Computing | Cryptographic Models | Equational Theories | TGC 2007 |

claim paper

Related Content

» Guessing Attacks and the Computational Soundness of Static Equivalence

» Computationally Sound Implementations of Equational Theories Against Passive Adversaries

» Adaptive Soundness of Static Equivalence

» Galois Connections and Fixed Point Calculus

» Computational Soundness of Formal Indistinguishability and Static Equivalence

» Equational Reasoning on Ad Hoc Networks

» Equational Reasoning on Mobile Ad Hoc Networks

» A Realizability Model for Impredicative Hoare Type Theory

» Precomputed acceleration noise for improved rigidbody sound

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	TGC
Authors	Steve Kremer

Comments (0)