34 search results - page 2 / 7 » Symbolic protocol analysis for monoidal equational theories |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
FROCOS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
ENTCS
2007
13 years 4 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...