YAPA: A Generic Tool for Computing Intruder Knowledge

DOI10.1007/978-3-642-02348-4_11zbMath1242.94018arXiv1005.0737OpenAlexW1872155400MaRDI QIDQ3636824

Stéphanie Delaune, Mathieu Baudet, Véronique Cortier

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.0737

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items (10)

Model Checking Security Protocols ⋮ Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties ⋮ Reducing equational theories for the decision of static equivalence ⋮ Computing knowledge in security protocols under convergent equational theories ⋮ Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Computing Knowledge in Security Protocols under Convergent Equational Theories ⋮ Compiling and securing cryptographic protocols ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ YAPA ⋮ Deciding knowledge in security protocols under some e-voting theories

Uses Software

• AVISPA
• ProVerif

Cites Work

• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Deciding knowledge in security protocols under equational theories
• Automated verification of selected equivalences for security protocols
• YAPA
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• Mobile values, new names, and secure communication
• Intruders with Caps
• Automata, Languages and Programming
• Foundations of Software Science and Computation Structures

This page was built for publication: YAPA: A Generic Tool for Computing Intruder Knowledge