Knowledge problems in protocol analysis: extending the notion of subterm convergent

DOI10.46298/LMCS-22(2:15)2026MaRDI QIDQ7254992zbMATH OpenFDO

Authors Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen

Publication date 29 May 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:15)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• Automated verification of equivalence properties of cryptographic protocols
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
• Computing knowledge in security protocols under convergent equational theories
• Deciding knowledge in security protocols under equational theories
• Folding variant narrowing and optimal variant termination
• scientific article; zbMATH DE number 5032352 (Why is no real title available?)
• Intruder deduction problem for locally stable theories with normal forms and inverses
• Intruders with Caps
• Knowledge problems in security protocols: going beyond subterm convergent theories
• Mobile values, new names, and secure communication
• Notions of knowledge in combinations of theories sharing constructors
• On Forward Closure and the Finite Variant Property
• Term Rewriting and Applications
• Unification modulo homomorphic encryption
• YAPA: a generic tool for computing intruder knowledge

This page was built for publication: Knowledge problems in protocol analysis: extending the notion of subterm convergent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254992)