1 Department of Informatics and Mathematical Modeling, Technical University of Denmark
The security of a network protocol crucially relies on the scenario in which the protocol is deployed. This paper describes syntactic constructs for modelling network scenarios and presents an automated analysis tool, which can guarantee that security properties hold in all of the (infinitely many) instances of a scenario. The tool is based on control flow analysis of the process calculus LySa and is applied to the Bauer, Berson, and Feiertag protocol where is reveals a previously undocumented problem, which occurs in some scenarios but not in other.
Lecture Notes in Computer Science, 2005, p. 334-352
Main Research Area:
Lecture Notes in Computer Science
International Symposium on Trustworthy Global Computing, 2005