Name
Abstract | ||
|---|---|---|
The tools for cryptographic protocols analysis based on state exploration are designed to be completely automatic and should carry out their job with a reasonable amount of computing and storage resources, even when run by users having a limited amount of expertise in the field. This paper compares four tools of this kind to highlight their features and ability to detect bugs under the same experimental conditions. To this purpose, the ability of each tool to detect known flaws in a uniform set of well-known cryptographic protocols has been checked. Results are also given on the relative performance of the tools when analysing several known-good protocols with an increasing number of parallel sessions. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.csi.2008.09.030 | Computer Standards & Interfaces |
Keywords | Field | DocType |
increasing number,relative performance,known-good protocol,experimental comparison,well-known cryptographic protocol,reasonable amount,cryptographic protocols analysis,parallel session,experimental condition,state exploration,limited amount,formal methods,formal method,cryptographic protocol | Cryptographic protocol,Computer science,Cryptographic primitive,Formal methods,Protocol verification,Distributed computing | Journal |
Volume | Issue | ISSN |
31 | 5 | 0920-5489 |
Citations | PageRank | References |
6 | 0.63 | 22 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Cheminod | 1 | 139 | 10.52 |
| Ivan Cibrario Bertolotti | 2 | 118 | 16.04 |
| Luca Durante | 3 | 231 | 20.12 |
| Riccardo Sisto | 4 | 556 | 56.79 |
| Adriano Valenzano | 5 | 535 | 58.77 |