Reducing equational theories for the decision of static equivalence

DOI10.1007/S10817-010-9203-0zbMath1242.68104OpenAlexW2062667260MaRDI QIDQ437026

Antoine Mercier, Steve Kremer, Ralf Treinen

Publication date: 17 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9203-0

zbMATH Keywords

formal methodscomputer securitystatic equivalence

Mathematics Subject Classification ID

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

Uses Software

• YAPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding knowledge in security protocols under equational theories
• Computationally sound implementations of equational theories against passive adversaries
• Automated verification of selected equivalences for security protocols
• Hierarchical combination of intruder theories
• Combining Algorithms for Deciding Knowledge in Security Protocols
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Reducing Equational Theories for the Decision of Static Equivalence
• On the security of public key protocols
• Mobile values, new names, and secure communication
• Computing Knowledge in Security Protocols under Convergent Equational Theories

This page was built for publication: Reducing equational theories for the decision of static equivalence