TCS / Research / Publications / Efficient infinite-state analysis of security protocols
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Efficient infinite-state analysis of security protocols

Reference:

Antti Huima. Efficient infinite-state analysis of security protocols. In Proc. FLOC'99 Workshop on Formal Methods and Security Protocols, 1999.

Abstract:

We propose a new method and present a tool for the analysis of cryptographic protocols. The method is based on symbolic state space search. It can be used to analyze thoroughly an infinite state space if the infiniteness is caused only by the infiniteness of the enemy but not by an unbounded number of interleaved protocol runs nor unbounded behaviours of single protocol participants. The method is complete for the class of protocols it is defined for and does not require user interaction to work.

Suggested BibTeX entry:

@inproceedings{Huima99b,
    author = {Antti Huima},
    booktitle = {Proc.\ {FLOC'99} Workshop on Formal Methods and Security Protocols},
    title = {Efficient infinite-state analysis of security protocols},
    year = {1999},
}

PostScript (216 kB)
GZipped PostScript (65 kB)

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.