Theory of linear and integer programming
Theory of linear and integer programming
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Unification in commutative theories
Journal of Symbolic Computation
Unification in monoidal theories
CADE-10 Proceedings of the tenth international conference on Automated deduction
Handbook of theoretical computer science (vol. B)
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
Unification in the union of disjoint equational theories: combining decision procedures
Journal of Symbolic Computation
Combination of constraint solvers for free and quasi-free structures
Theoretical Computer Science - Special issue: rewriting systems and applications
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
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
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications 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
Hierarchical combination of intruder theories
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Easy intruder deduction problems with homomorphisms
Information Processing Letters
Guessing attacks and the computational soundness of static equivalence
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computationally sound implementations of equational theories against passive adversaries
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Intruder deduction for AC-like equational theories with homomorphisms
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Security protocols, constraint systems, and group theories
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |
In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, ...). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually considered: deducibility and indistinguishability. Those notions are well-studied and several decidability results already exist to deal with a variety of equational theories. Most of the existing results are dedicated to specific equational theories and only few results, especially in the case of indistinguishability, have been obtained for equational theories with associative and commutative properties $(\textsf{AC})$ . In this paper, we show that existing decidability results can be easily combined for any disjoint equational theories: if the deducibility and indistinguishability relations are decidable for two disjoint theories, they are also decidable for their union. We also propose a general setting for solving deducibility and indistinguishability for an important class (called monoidal) of equational theories involving $\textsf{AC}$ operators. As a consequence of these two results, new decidability and complexity results can be obtained for many relevant equational theories.