Sciweavers

17 search results - page 1 / 4
» Computational Soundness of Equational Theories (Tutorial)
Sort
View
TGC
2007
Springer
13 years 10 months ago
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 resul...
Steve Kremer
FOSSACS
2006
Springer
13 years 8 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
ICALP
2005
Springer
13 years 10 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
ESORICS
2007
Springer
13 years 10 months ago
Adaptive Soundness of Static Equivalence
Abstract. We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equiva...
Steve Kremer, Laurent Mazaré
ACMMPC
2000
Springer
231views Mathematics» more  ACMMPC 2000»
13 years 9 months ago
Galois Connections and Fixed Point Calculus
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
Roland Carl Backhouse