13 search results - page 1 / 3 » Proving Security Protocols with Model Checkers by Data Indep... |
CSFW
1998
IEEE
13 years 8 months ago
1998
IEEE
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
CSFW
1999
IEEE
13 years 8 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
ATVA
2009
Springer
13 years 11 months ago
2009
Springer
We present a data symmetry reduction approach for model temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and ...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
CSFW
2002
IEEE
13 years 9 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...