7 search results - page 1 / 2 » Extending the Dolev-Yao Intruder for Analyzing an Unbounded ... |
CSL
2003
Springer
13 years 10 months ago
2003
Springer
LICS
2003
IEEE
13 years 10 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
LICS
2003
IEEE
13 years 10 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 ...
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
CCS
2008
ACM
13 years 6 months ago
2008
ACM
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...