Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 393

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Strand spaces: why is a security protocol correct?

Fabrega, F.J.T., Herzog, J.C., Guttman, J.D. · 2002 · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)

Abstract

A strand is a sequence of events; it represents either the execution of an action by a legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a collection of strands, equipped with a graph structure generated by causal interaction. In this framework, protocol correctness claims may be expressed in terms of the connections between strands of different kinds. In this paper, we develop the notion of a strand space. We then prove a generally useful lemma, as a sample result giving a general bound on the abilities of the penetrator in any protocol. We apply the strand space formalism to prove the correctness of the Needham-Schroeder-Lowe protocol (G. Lowe, 1995, 1996). Our approach gives a detailed view of the conditions under which the protocol achieves authentication and protects the secrecy of the values exchanged. We also use our proof methods to explain why the original Needham-Schroeder (1978) protocol fails. We believe that our approach is distinguished from other work on protocol verification by the simplicity of the model and the ease of producing intelligible and reliable proofs of protocol correctness even without automated support.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/secpri.1998.674832

Cites

21 of 21 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 21 references

Cited by

See all 393

Metadata

Authors
Fabrega, F. J. T., Herzog, J. C., & Guttman, J. D.
Venue
Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
Published
2002-11-27
Pages
160-171
ISSN
1081-6011 (ISSN-L)
OpenAlex
W2150426251
Cited by
393
References
21
FWCI
21.87
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: Strand spaces: why is a security protocol correct? https://app.cochat.ai/papers/10.1109/secpri.1998.674832
The paper
Fabrega, F. J. T., Herzog, J. C., & Guttman, J. D. (2002). Strand spaces: why is a security protocol correct? Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186). https://doi.org/10.1109/secpri.1998.674832

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.