Deciding knowledge in security protocols under equational theories
type: Item
instance of: scholarly article
title: Deciding knowledge in security protocols under equational theories
zbMATH Open document ID: 1153.94339
author: Martín Abadi
author: Véronique Cortier
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 5083532
zbMATH Keywords: cryptography
zbMATH Keywords: decidability
Wikidata QID: Q115036558
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.08.032
OpenAlex ID: W2060349224
cites work: Automata, Languages and Programming
cites work: Mobile values, new names, and secure communication
cites work: Q4230922
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: Q4411970
cites work: Automated verification of selected equivalences for security protocols
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: An NP decision procedure for protocol insecurity with XOR
cites work: Foundations of Software Science and Computation Structures
cites work: Verification: Theory and Practice
cites work: On the security of public key protocols
cites work: Probabilistic encryption
cites work: Three systems for cryptographic protocol analysis
cites work: Programming Languages and Systems
cites work: Term Rewriting and Applications
cites work: Q5618446
DOI: 10.1016/J.TCS.2006.08.032
description: scientific article; zbMATH DE number 5083532