Abstract
Gordon and Jeffrey developed a type system for verification of
asymmetric and symmetric cryptographic protocols.
We propose a modified version of Gordon and Jeffrey's type system
and develop a type inference algorithm for it, so that protocols can
be verified automatically as they are, without any type annotations
or explicit type casts. We have implemented a protocol verifier
SpiCa based on the algorithm, and confirmed its effectiveness.
asymmetric and symmetric cryptographic protocols.
We propose a modified version of Gordon and Jeffrey's type system
and develop a type inference algorithm for it, so that protocols can
be verified automatically as they are, without any type annotations
or explicit type casts. We have implemented a protocol verifier
SpiCa based on the algorithm, and confirmed its effectiveness.
Originalsprog | Engelsk |
---|---|
Bogserie | Lecture Notes in Computer Science |
Vol/bind | 6996 |
Sider (fra-til) | 75-89 |
Antal sider | 15 |
ISSN | 0302-9743 |
DOI | |
Status | Udgivet - 2011 |
Begivenhed | 9th International Symposium on Automated Technology for Verification and Analysis - Taipei, Taiwan Varighed: 11 okt. 2011 → 14 okt. 2011 Konferencens nummer: 9 |
Konference
Konference | 9th International Symposium on Automated Technology for Verification and Analysis |
---|---|
Nummer | 9 |
Land/Område | Taiwan |
By | Taipei |
Periode | 11/10/2011 → 14/10/2011 |