The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A hierarchy of authentication specifications
Abstract
Many security protocols have the aim of authenticating one agent to another. Yet there is no clear consensus in the academic literature about precisely what "authentication" means. We suggest that the appropriate authentication requirement will depend upon the use to which the protocol is put, and identify several possible definitions of "authentication". We formalize each definition using the process algebra CSP, use this formalism to study their relative strengths, and show how the model checker FDR can be used to test whether a system running the protocol meets such a specification.
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
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
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
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
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
Lowe, G. (1996) · Cited by 582
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-citationLimitations of the Kerberos authentication system
Bellovin, S. M., & Merritt, M. (1990) · ACM SIGCOMM Computer Communication Review · doi:10.1145/381906.381946 · Cited by 255
Systematic design of a family of attack-resistant authentication protocols
Bird, R., Gopal, I., Herzberg, A., Janson, P. A., Kutten, S., Molva, R. A., & Yung, M. M. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223869 · Cited by 141
Intensional specifications of security protocols
Roscoe, A. W. (2002) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.1996.503688 · Cited by 95
What do we mean by entity authentication?
Gollmann, D. (2002) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/secpri.1996.502668 · Cited by 56
Cited by
OFMC: 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
Automated Security Protocol Analysis With the AVISPA Tool
Viganò, L. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.11.052 · Cited by 452
A Formal Analysis of 5G Authentication
Basin, D., Dreier, J., Hirschi, L., Radomirovic, S., Sasse, R., & Stettler, V. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243846 · Cited by 412
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) · doi:10.1109/secpri.1998.674832 · Cited by 393
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
Blanchet, B. (2016) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000004 · Cited by 321
Metadata
- Authors
- Lowe, G.
- Venue
- Proceedings 10th Computer Security Foundations Workshop
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-22
- Pages
- 31-43
- OpenAlex
- W2145415641
- Cited by
- 630
- References
- 14
- FWCI
- 21.69
- 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.