Combining Intruder Theories

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, cation/exponentiation, abstract encryption/decryption. In this paper 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.

• Type: Conference
• Year: 2005
• Where: ICALP
• Authors: Yannick Chevalier, Michaël Rusinowitch
• Keywords: Decision Procedure, ICALP 2005, Intruder Constraints, Intruder Theories, Theoretical Computer Science