The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Casper: a compiler for the analysis of security protocols
Abstract
In recent years, a method for analyzing security protocols using the process algebra CSP (C.A.R. Hoare, 1985) and its model checker FDR (A.W Roscoe, 1994) has been developed. This technique has proved successful, and has been used to discover a number of attacks upon protocols. However the technique has required producing a CSP description of the protocol by hand; this has proved tedious and error prone. We describe Casper, a program that automatically produces the CSP description from a more abstract description, thus greatly simplifying the modelling and analysis process.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Communicating sequential processes
(1986) · Microprocessors and Microsystems · doi:10.1016/0141-9331(86)90196-1 · Cited by 2,167
Encrypted key exchange: password-based protocols secure against dictionary attacks
Bellovin, S. M., & Merritt, M. (2003) · Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1992.213269 · Cited by 1,353
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61042-1_43 · Cited by 872
Self-citationTimestamps 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. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74852 · Cited by 641
A hierarchy of authentication specifications
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596782 · Cited by 630
Self-citationBreaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Cited by 582
Self-citationEfficient and timely mutual authentication
Otway, D., & Rees, O. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/24592.24594 · Cited by 335
Using CSP to detect errors in the TMN protocol
Lowe, G., & Roscoe, B. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.637148 · Cited by 188
Self-citationA security risk of depending on synchronized clocks
Gong, L. (1992) · ACM SIGOPS Operating Systems Review · doi:10.1145/130704.130709 · Cited by 157
Anderson, R., & Needham, R. M. (1995) · Lecture notes in computer science · doi:10.1007/bfb0015258 · Cited by 151
Reducing risks from poorly chosen keys
Lomas, T., Gong, L., Saltzer, J. H., & Needhamn, R. (1989) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/74850.74853 · Cited by 118
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
A nonce-based protocol for multiple authentications
Kehne, A., Schönwälder, J., & Langendörfer, H. (1992) · ACM SIGOPS Operating Systems Review · doi:10.1145/142854.142872 · Cited by 67
Using one-way functions for authentication
Gong, L. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74682 · Cited by 67
Cited by
A hierarchy of authentication specifications
Lowe, G. (2002) · Proceedings 10th Computer Security Foundations Workshop · doi:10.1109/csfw.1997.596782 · Cited by 630
Self-citationStrand 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) · doi:10.1109/secpri.1998.674832 · Cited by 393
Injective 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
- Proceedings 10th Computer Security Foundations Workshop
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 18-30
- OpenAlex
- W2170718011
- Cited by
- 305
- References
- 21
- FWCI
- 18.48
- 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
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.