3 search results - page 1 / 1 » Secrecy for bounded security protocols with freshness check ... |
88
Voted
JCS
2008
14 years 9 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...
113
click to vote
CSFW
1999
IEEE
15 years 1 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...
106
click to vote
CSFW
2002
IEEE
15 years 2 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 ...