Decidability and combination results for two notions of knowledge in security protocols

DOI10.1007/S10817-010-9208-8zbMath1242.68099OpenAlexW2036714652MaRDI QIDQ437043

Stéphanie Delaune, Véronique Cortier

Publication date: 17 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9208-8

zbMATH Keywords

formal methodsequational theoriessecurity protocols

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ Satisfiability of general intruder constraints with and without a set constructor ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols

Cites Work

• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Unification in commutative theories
• Unification in a combination of arbitrary disjoint equational theories
• Deciding knowledge in security protocols under equational theories
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Easy intruder deduction problems with homomorphisms
• A simple presentation of a group with unsolvable word problem
• Combination of constraint solvers for free and quasi-free structures
• Deciding the word problem in the union of equational theories.
• 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
• Symbolic protocol analysis for monoidal equational theories
• Hierarchical combination of intruder theories
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• Hierarchical Combination of Intruder Theories
• Mobile values, new names, and secure communication
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Verification: Theory and Practice
• Programming Languages and Systems
• Term Rewriting and Applications
• Automata, Languages and Programming
• Automata, Languages and Programming
• Foundations of Software Science and Computation Structures

This page was built for publication: Decidability and combination results for two notions of knowledge in security protocols