Abstract
We propose a constraint-based system for the verification of security protocols that improves upon the one developed by Millen and Shmatikov. Our system features (1) a significantly more efficient implementation, (2) a monotonic behavior, which also allows to detect aws associated to partial runs and (3) a more expressive syntax, in which a principal may also perform explicit checks. We also show why these improvements yield a more effective and practical system.
Original language | English |
---|---|
Title of host publication | Static Analysis |
Subtitle of host publication | 9th International Symposium, SAS 2002 Madrid, Spain, September 17–20, 2002, Proceedings |
Editors | Manuel V. Hermenegildo, German Puebla |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 239-265 |
Number of pages | 16 |
ISBN (Electronic) | 978-3-540-45789-3 |
ISBN (Print) | 978-3-540-44235-6 |
DOIs | |
Publication status | Published - Sep 2002 |
Event | 9th International Symposium on Static Analysis, SAS 2002 - Madrid, Spain Duration: 17 Sep 2002 → 20 Sep 2002 Conference number: 9 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2477 |
ISSN (Print) | 0302-9743 |
Conference
Conference | 9th International Symposium on Static Analysis, SAS 2002 |
---|---|
Abbreviated title | SAS |
Country | Spain |
City | Madrid |
Period | 17/09/02 → 20/09/02 |
Keywords
- SCS-Cybersecurity
- Security protocol
- Mutual authentication
- Cryptographic protocols
- Parallel session
- Strand space