Recommendations
Cites work
- Alice and Bob meet equational theories
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Compiling and securing cryptographic protocols
- Computer Aided Verification
- Cryptographic Protocol Explication and End-Point Projection
- Deconstructing Alice and Bob
- Folding variant narrowing and optimal variant termination
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- On the semantics of Alice \& Bob specifications of security protocols
- Provably repairing the ISO/IEC 9798 standard for entity authentication
- Term Rewriting and All That
- Term Rewriting and Applications
Cited in
(8)- Introducing commutative and associative operators in cryptographic protocol analysis
- 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
- scientific article; zbMATH DE number 1956542 (Why is no real title available?)
- G2C: cryptographic protocols from goal-driven specifications
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)