Sciweavers

33 search results - page 2 / 7
» Reducing Equational Theories for the Decision of Static Equi...
Sort
View
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
13 years 8 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
ENTCS
2006
103views more  ENTCS 2006»
13 years 4 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
ENTCS
2007
116views more  ENTCS 2007»
13 years 4 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen
FROCOS
2000
Springer
13 years 8 months ago
Combining Equational Theories Sharing Non-Collapse-Free Constructors
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
Franz Baader, Cesare Tinelli
CCS
2005
ACM
13 years 10 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet