The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Automated analysis of cryptographic protocols using Murφ
Abstract
A methodology is presented for using a general-purpose state enumeration tool, Mur/spl phi/, to analyze cryptographic and security-related protocols. We illustrate the feasibility of the approach by analyzing the Needham-Schroeder (1978) protocol, finding a known bug in a few seconds of computation time, and analyzing variants of Kerberos and the faulty TMN protocol used in another comparative study. The efficiency of Mur/spl phi/ also allows us to examine multiple terms of relatively short protocols, giving us the ability to detect replay attacks, or errors resulting from confusion between independent execution of a protocol by independent parties.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Using encryption for authentication in large networks of computers
Needham, R. M., & Schroeder, M. D. (1978) · Communications of the ACM · doi:10.1145/359657.359659 · Cited by 2,362
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
The Kerberos Network Authentication Service (V5)
Kohl, J., & Neuman, C. (1993) · doi:10.17487/rfc1510 · Cited by 514
Three systems for cryptographic protocol analysis
Kemmerer, R., Meadows, C., & Millen, J. (1994) · Journal of Cryptology · doi:10.1007/bf00197942 · Cited by 234
Analyzing the Needham-Schroeder public key protocol: A comparison of two approaches
Meadows, C. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61770-1_46 · Cited by 106
Cited by
An efficient cryptographic protocol verifier based on prolog rules
Blanchet, B. (2005) · Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. · doi:10.1109/csfw.2001.930138 · Cited by 967
Mobile values, new names, and secure communication
Abadi, M., & Fournet, C. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360213 · Cited by 846
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*
Abadi, M., & Rogaway, P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0014-7 · Cited by 613
Architectural support for copy and tamper resistant software
Thekkath, D. L. C., Mitchell, M., Lincoln, P., Boneh, D., Mitchell, J., & Horowitz, M. (2000) · ACM SIGARCH Computer Architecture News · doi:10.1145/378995.379237 · Cited by 597
Self-citationOFMC: A symbolic model checker for security protocols
Basin, D., Mödersheim, S., & Viganò, L. (2005) · International Journal of Information Security · doi:10.1007/s10207-004-0055-7 · Cited by 504
Metadata
- Authors
- Mitchell, J. C., Mitchell, M., & Stern, U.
- Venue
- Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097)
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 141-151
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2150682469
- Cited by
- 476
- References
- 5
- FWCI
- 29.84
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automated analysis of cryptographic protocols using Murφ. https://app.cochat.ai/papers/10.1109/secpri.1997.601329
- The paper
- Mitchell, J. C., Mitchell, M., & Stern, U. (2002). Automated analysis of cryptographic protocols using Murφ. Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097). https://doi.org/10.1109/secpri.1997.601329
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.