An undecidability result for AGh

DOI10.1016/J.TCS.2006.08.018zbMath1171.94344OpenAlexW1988194273MaRDI QIDQ859845

Stéphanie Delaune

Publication date: 22 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.018

zbMATH Keywords

formal methodsconstraint solvingsecurity protocols

Mathematics Subject Classification ID

Cryptography (94A60) Undecidability and degrees of sets of sentences (03D35) Network protocols (68M12)

Related Items (4)

An undecidability result for AGh ⋮ Intruder deduction for the equational theory of abelian groups with distributive encryption ⋮ Symbolic protocol analysis for monoidal equational theories ⋮ Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions

Cites Work

• An undecidability result for AGh
• Tree automata with one memory set constraints and cryptographic protocols
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
• On the security of public key protocols
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An undecidability result for AGh