Computing Knowledge in Security Protocols under Convergent Equational Theories

DOI10.1007/978-3-642-02959-2_27zbMath1250.03016OpenAlexW1619779852MaRDI QIDQ5191113

Stéphanie Delaune, Steve Kremer, Ştefan Ciobâcă

Publication date: 28 July 2009

Published in: Automated Deduction – CADE-22 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.6345

Mathematics Subject Classification ID

Related Items (7)

Model Checking Security Protocols ⋮ Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Reducing equational theories for the decision of static equivalence ⋮ Computing knowledge in security protocols under convergent equational theories ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ Deciding knowledge in security protocols under some e-voting theories

Uses Software

• YAPA
• AVISPA

Cites Work

• Unnamed Item
• Unnamed Item
• Computing knowledge in security protocols under convergent equational theories
• Deciding knowledge in security protocols under equational theories
• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Mobile values, new names, and secure communication
• Intruders with Caps
• Computer Aided Verification

This page was built for publication: Computing Knowledge in Security Protocols under Convergent Equational Theories