Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2010

Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures

(1, 2) , (3)
1
2
3

Abstract

Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples of such sets of operators comprise XOR, multiplication, abstract encryption/decryption. In this report we give an algorithm for combining decision procedures for arbitrary intruder theories with disjoint sets of operators, provided that solvability of ordered intruder constraints, a slight generalization of intruder constraints, can be decided in each theory. This is the case for most of the intruder theories for which a decision procedure has been given. In particular our result allows us to decide trace-based security properties of protocols that employ any combination of the above mentioned operators with a bounded number of sessions.

Dates and versions

inria-00455290 , version 1 (10-02-2010)

Identifiers

Cite

Yannick Chevalier, Michael Rusinowitch. Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures. Theoretical Computer Science, 2010, 411 (10), pp.1261-1282. ⟨10.1016/j.tcs.2009.10.022⟩. ⟨inria-00455290⟩
131 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More