On word problems in equational theories
14th International Colloquium on Automata, languages and programming
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Intercepting mobile communications: the insecurity of 802.11
Proceedings of the 7th annual international conference on Mobile computing and networking
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An NP Decision Procedure for Protocol Insecurity with XOR
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Tool for Lazy Verification of Security Protocols
Proceedings of the 16th IEEE international conference on Automated software engineering
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation
Journal of Computer Security
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Combining Algorithms for Deciding Knowledge in Security Protocols
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Towards an Automatic Analysis of Web Service Security
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Proof Theoretic Analysis of Intruder Theories
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Compiling and securing cryptographic protocols
Information Processing Letters
Automated Security Protocol Analysis With the AVISPA Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximation-based tree regular model-checking
Nordic Journal of Computing
Deciding knowledge in security protocols for monoidal equational theories
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Key substitution in the symbolic analysis of cryptographic protocols
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A symbolic intruder model for hash-collision attacks
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A dolev-yao-based definition of abuse-free protocols
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decidability of Equivalence of Symbolic Derivations
Journal of Automated Reasoning
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols
Journal of Automated Reasoning
Deducibility constraints, equational theory and electronic money
Rewriting Computation and Proof
| Hi-index | 0.00 |
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/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.