147 search results - page 6 / 30 » An intruder model for verifying liveness in security protoco... |
112
click to vote
PADL
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
125
Voted
LOPSTR
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
IEEEHPCS
2010
15 years 10 days ago
2010
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
128
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their applicability...
128
Voted
FUIN
2007
15 years 1 months ago
2007
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...