Symbolic protocol analysis for monoidal equational theories

DOI10.1016/j.ic.2007.07.005zbMath1148.68325OpenAlexW2046270839MaRDI QIDQ2482449

Denis Lugiez, Ralf Treinen, Stéphanie Delaune, Pascal Lafourcade

Publication date: 16 April 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2007.07.005

zbMATH Keywords

cryptographic protocolsDolev-Yao model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items

Deciding Knowledge in Security Protocols for Monoidal Equational Theories, Decidability and combination results for two notions of knowledge in security protocols, Deducibility constraints and blind signatures, Challenges in the Automated Verification of Security Protocols, Satisfiability of general intruder constraints with and without a set constructor, A Proof Theoretic Analysis of Intruder Theories, Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An attack on a recursive authentication protocol. A cautionary tale
• An NP decision procedure for protocol insecurity with XOR
• An undecidability result for AGh
• Easy intruder deduction problems with homomorphisms
• On the symbolic reduction of processes with cryptographic functions.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Unification in the union of disjoint equational theories: Combining decision procedures
• Combination problems for commutative/monoidal theories or how algebra can help in equational unification
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• Hierarchical Combination of Intruder Theories
• Associative-Commutative Deducibility Constraints
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
• An Efficient Unification Algorithm
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Automatic recognition of tractability in inference relations
• Verification: Theory and Practice
• Foundations of Software Science and Computation Structures
• Algebraic Intruder Deductions
• Term Rewriting and Applications
• Automata, Languages and Programming
• Foundations of Software Science and Computation Structures