Sciweavers

147 search results - page 4 / 30
» An intruder model for verifying liveness in security protoco...
Sort
View
LPAR
2007
Springer
15 years 5 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ESORICS
2004
Springer
15 years 5 months ago
A Formalization of Anonymity and Onion Routing
The use of formal methods to verify security protocols with respect to secrecy and authentication has become standard practice. In contrast, the formalization of other security goa...
Sjouke Mauw, Jan Verschuren, Erik P. de Vink
SAFECOMP
2007
Springer
15 years 5 months ago
Intrusion Attack Tactics for the Model Checking of e-Commerce Security Guarantees
In existing security model-checkers the intruder’s behavior is defined as a message deducibility rule base governing use of eavesdropped information, with the aim to find out a m...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
15 years 3 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
FOSAD
2009
Springer
15 years 6 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò