3 search results - page 1 / 1 » Secrecy for bounded security protocols with freshness check ... |
JCS
2008
13 years 7 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
CSFW
1999
IEEE
13 years 11 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...
CSFW
2002
IEEE
14 years 13 days 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 ...