The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
Open accessOverview
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
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
Timestamps in key distribution protocols
Denning, D. E., & Sacco, G. M. (1981) · Communications of the ACM · doi:10.1145/358722.358740 · Cited by 682
An attack on the Needham-Schroeder public-key authentication protocol
Lowe, G. (1995) · Information Processing Letters · doi:10.1016/0020-0190(95)00144-2 · Cited by 647
Self-citationBurrows, M., Abadi, M., & Needham, R. M. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0125 · Cited by 639
Cited by
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Formal Methods: State of the Art and Future Directions
Clarke, E., Wing, J. M., & Jones, C. B. (1996) · doi:10.25405/ncl.34123050 · Cited by 1,122
A hierarchy of authentication specifications
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596782 · Cited by 630
Self-citationCasper: a compiler for the analysis of security protocols
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596779 · Cited by 305
Self-citationInjective synchronisation: An extension of the authentication hierarchy
Cremers, C. J. F., Mauw, S., & de Vink, E. P. (2006) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.08.034 · Cited by 61
Metadata
- Authors
- Lowe, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 147-166
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2155032609
- Cited by
- 872
- References
- 8
- FWCI
- 13.73
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR. https://app.cochat.ai/papers/10.1007/3-540-61042-1_43
- The paper
- Lowe, G. (1996). Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-61042-1_43
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.
