An attack on a recursive authentication protocol. A cautionary tale
From MaRDI portal
Publication:293167
DOI10.1016/S0020-0190(97)00180-4zbMATH Open1339.94062OpenAlexW2078671172MaRDI QIDQ293167FDOQ293167
Authors: S. A. Schneider, Peter Y. A. Ryan
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097001804?np=y
Recommendations
Cites Work
Cited In (12)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Title not available (Why is that?)
- An NP decision procedure for protocol insecurity with XOR
- A domain-specific language for cryptographic protocols based on streams
- Simulation relations for alternating Büchi automata
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Analysis of the Yahalom-Paulson protocol and its improvement
- Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
- Symbolic protocol analysis for monoidal equational theories
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Combining proverif and automated theorem provers for security protocol verification
- Two attacks on Neuman-Stubblebine authentication protocols
This page was built for publication: An attack on a recursive authentication protocol. A cautionary tale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293167)