Alice and Bob Meet Equational Theories

DOI10.1007/978-3-319-23165-5_7zbMath1321.68343OpenAlexW2293715571MaRDI QIDQ2945705

Michel Keller, Saša Radomirović, Ralf Sasse, David A. Basin

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23165-5_7

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items (2)

Alice and Bob: Reconciling Formal Models and Implementation ⋮ Alice and Bob Meet Equational Theories

Uses Software

• AVISPA
• Maude
• ProVerif
• Casper
• GitHub
• scyther-proof
• TAMARIN

Cites Work

• Unnamed Item
• On the semantics of Alice \& Bob specifications of security protocols
• Compiling and securing cryptographic protocols
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Folding variant narrowing and optimal variant termination
• Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication
• Alice and Bob Meet Equational Theories
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Cryptographic Protocol Explication and End-Point Projection
• Term Rewriting and All That
• Term Rewriting and Applications
• Computer Aided Verification

This page was built for publication: Alice and Bob Meet Equational Theories