58 search results - page 1 / 12 » Normal Proofs in Intruder Theories |
ASIAN
2006
Springer
13 years 8 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
LICS
2003
IEEE
13 years 9 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
NIL
1991
13 years 8 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
LOPSTR
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...