Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a number of novel features, including: (1) Guaranteed termination, after which the result is either unbounded correctness, falsi...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2008
|
| _version_ | 1797065350715539456 |
|---|---|
| author | Cremers, C |
| author_facet | Cremers, C |
| author_sort | Cremers, C |
| collection | OXFORD |
| description | We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a number of novel features, including: (1) Guaranteed termination, after which the result is either unbounded correctness, falsification, or bounded correctness. (2) Efficient generation of a finite representation of an infinite set of traces in terms of patterns, also known as a complete characterization. (3) State-of-the-art performance, which has made new types of protocol analysis feasible, such as multi-protocol analysis. Copyright 2008 ACM. |
| first_indexed | 2024-03-06T21:27:24Z |
| format | Journal article |
| id | oxford-uuid:438eb2f3-755e-4511-aea1-abc93717e71d |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T21:27:24Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | oxford-uuid:438eb2f3-755e-4511-aea1-abc93717e71d2022-03-26T14:56:11ZUnbounded verification, falsification, and characterization of security protocols by pattern refinementJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:438eb2f3-755e-4511-aea1-abc93717e71dEnglishSymplectic Elements at Oxford2008Cremers, CWe present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a number of novel features, including: (1) Guaranteed termination, after which the result is either unbounded correctness, falsification, or bounded correctness. (2) Efficient generation of a finite representation of an infinite set of traces in terms of patterns, also known as a complete characterization. (3) State-of-the-art performance, which has made new types of protocol analysis feasible, such as multi-protocol analysis. Copyright 2008 ACM. |
| spellingShingle | Cremers, C Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title | Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title_full | Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title_fullStr | Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title_full_unstemmed | Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title_short | Unbounded verification, falsification, and characterization of security protocols by pattern refinement |
| title_sort | unbounded verification falsification and characterization of security protocols by pattern refinement |
| work_keys_str_mv | AT cremersc unboundedverificationfalsificationandcharacterizationofsecurityprotocolsbypatternrefinement |