Rewriting-based verification of authentication protocols
From MaRDI portal
Recommendations
Cites work
- A hidden agenda
- An attack on the Needham-Schroeder public-key authentication protocol
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1543338 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 1860625 (Why is no real title available?)
- On the security of public key protocols
- Refutational theorem proving using term-rewriting systems
- Using encryption for authentication in large networks of computers
- Web-based support for cooperative software engineering
Cited in
(9)- An approach for formal verification of authentication protocols
- On the relationships between models in protocol verification
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- A rewriting strategy for protocol verification
- Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
- scientific article; zbMATH DE number 1962755 (Why is no real title available?)
- scientific article; zbMATH DE number 2090061 (Why is no real title available?)
- Verification and modelling of authentication protocols
- CHAP and rewrite components
This page was built for publication: Rewriting-based verification of authentication protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851055)