Output details
11 - Computer Science and Informatics
University of Edinburgh
Output title
From One Session to Many : Dynamic Tags for Security Protocols
Type
E - Conference contribution
Name of conference/published proceedings
Logic for Programming, Artificial Intelligence, and Reasoning : 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings
Volume number
5330
Issue number
-
First page of article
128
ISSN of proceedings
0302-9743
Year of publication
2008
Number of additional authors
2
Additional information
<10> Originality: This paper characterizes a large class of protocols for which it suffices to verify the security of one protocol session to conclude security for an unbounded number of sessions. A novel proof technique is developed.
Significance: This is an important decidability result, since security is undecidable in general. It addresses a problem that was identified as one of the challenges in the area of security protocols by Hubert Comon-Lundh in his IJCAR'08 invited talk. Other researchers have subsequently reused the proof technique to prove compositionality results.
Rigour: The proof of the main theorem is included in the paper.
Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
