35 search results - page 2 / 7 » An intruder model with message inspection for model checking... |
LICS
2003
IEEE
14 years 24 days 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...
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
FUIN
2007
13 years 7 months ago
2007
In this paper we offer a novel methodology for verifying correctness of (timed) security protocols. The idea consists in computing the time of a correct execution of a session and ...
ASIAN
2006
Springer
13 years 11 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 ...