Alice and Bob meet equational theories
From MaRDI portal
Publication:2945705
DOI10.1007/978-3-319-23165-5_7zbMATH Open1321.68343OpenAlexW2293715571MaRDI QIDQ2945705FDOQ2945705
Authors: Michel Keller, Saša Radomirović, Ralf Sasse, David 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
Recommendations
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)
Cites Work
- Computer Aided Verification
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Term Rewriting and All That
- Compiling and securing cryptographic protocols
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Term Rewriting and Applications
- On the semantics of Alice \& Bob specifications of security protocols
- Folding variant narrowing and optimal variant termination
- Deconstructing Alice and Bob
- Provably repairing the ISO/IEC 9798 standard for entity authentication
- Cryptographic Protocol Explication and End-Point Projection
- Alice and Bob meet equational theories
Cited In (8)
- Alice and Bob meet equational theories
- On the semantics of Alice \& Bob specifications of security protocols
- Alice and Bob: reconciling formal models and implementation
- Optimization of ProVerif Programs for AKE Protocols
- Deconstructing Alice and Bob
- Title not available (Why is that?)
- G2C: cryptographic protocols from goal-driven specifications
- Introducing commutative and associative operators in cryptographic protocol analysis
Uses Software
This page was built for publication: Alice and Bob meet equational theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945705)
