Deciding Knowledge in Security Protocols for Monoidal Equational Theories

DOI10.1007/978-3-540-75560-9_16MaRDI QIDQ3498466zbMATH OpenOpenAlexFDO

Authors Véronique Cortier, Stéphanie Delaune

Publication date 15 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75560-9_16

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Decidability and combination results for two notions of knowledge in security protocols
• Deciding knowledge in security protocols under equational theories
• Automata, Languages and Programming
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Symbolic protocol analysis for monoidal equational theories

Cites work

• Automata, Languages and Programming
• Automata, Languages and Programming
• Combination problems for commutative/monoidal theories or how algebra can help in equational unification
• Combining Algorithms for Deciding Knowledge in Security Protocols
• Deciding knowledge in security protocols under equational theories
• Easy intruder deduction problems with homomorphisms
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Mobile values, new names, and secure communication
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Symbolic protocol analysis for monoidal equational theories
• Term Rewriting and Applications
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• Unification in monoidal theories

Cited in

(17)

• Symbolic protocol analysis for monoidal equational theories
• An equation-based classical logic
• Deciding knowledge in security protocols under some e-voting theories
• Challenges in the Automated Verification of Security Protocols
• Deducibility Constraints, Equational Theory and Electronic Money
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Reducing equational theories for the decision of static equivalence
• Reducing equational theories for the decision of static equivalence
• Computing knowledge in security protocols under convergent equational theories
• Decidability and combination results for two notions of knowledge in security protocols
• scientific article; zbMATH DE number 7301460 (Why is no real title available?)
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Automated verification of equivalence properties of cryptographic protocols
• Automata, Languages and Programming
• A Proof Theoretic Analysis of Intruder Theories
• Deciding knowledge in security protocols under equational theories
• Compiling and securing cryptographic protocols

This page was built for publication: Deciding Knowledge in Security Protocols for Monoidal Equational Theories

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