Journal article icon

Journal article

Unbounded verification, falsification, and characterization of security protocols by pattern refinement

Abstract:

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-...

Expand abstract

Actions


Access Document


Publisher copy:
10.1145/1455770.1455787

Authors


Cremers, CJF More by this author
Journal:
Proceedings of the ACM Conference on Computer and Communications Security
Pages:
119-128
Publication date:
2008
DOI:
ISSN:
1543-7221
URN:
uuid:438eb2f3-755e-4511-aea1-abc93717e71d
Source identifiers:
427852
Local pid:
pubs:427852

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP