An undecidability result for AGh
type: Item
instance of: scholarly article
title: An undecidability result for AGh
zbMATH Open document ID: 1171.94344
author: Stéphanie Delaune
published in: Theoretical Computer Science
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5117657
zbMATH Keywords: formal methods
zbMATH Keywords: security protocols
zbMATH Keywords: constraint solving
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.08.018
OpenAlex ID: W1988194273
cites work: Q4484507
cites work: Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
cites work: Tree automata with one memory set constraints and cryptographic protocols
cites work: Q4115143
cites work: Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
cites work: Q4385532
cites work: On the security of public key protocols
cites work: Q4418589
cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
DOI: 10.1016/J.TCS.2006.08.018
description: scientific article; zbMATH DE number 5117657