The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A logic of authentication
Abstract
Questions of belief are essential in analysing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis: we show how various protocols differ subtly with respect to the required initial assumptions of the participants and their final beliefs. Our formalism has enabled us to isolate and express these differences with a precision that was not previously possible. It has drawn attention to features of protocols of which we and their authors were previously unaware, and allowed us to suggest improvements to the protocols. The reasoning about some protocols has been mechanically verified. This paper starts with an informal account of the problem, goes on to explain the formalism to be used, and gives examples of its application to protocols from the literature, both with shared-key cryptography and with public-key cryptography. Some of the examples are chosen because of their practical importance, whereas others serve to illustrate subtle points of the logic and to explain how we use it. We discuss extensions of the logic motivated by actual practice; for example, to account for the use of hash functions in signatures. The final sections contain a formal semantics of the logic and some conclusions.
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
On the security of public key protocols
Dolev, D., & Yao, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056650 · Cited by 5,833
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Timestamps in key distribution protocols
Denning, D. E., & Sacco, G. M. (1981) · Communications of the ACM · doi:10.1145/358722.358740 · Cited by 682
DeMillo, R. A., Lynch, N. A., & Merritt, M. J. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802214 · Cited by 234
A key distribution protocol using event markers
Bauer, R., Berson, T., & Feiertag, R. J. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357373 · Cited by 72
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A calculus for cryptographic protocols: the spi calculus
Abadi, M., & Gordon, A. D. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266432 · Cited by 1,154
Self-citationBreaking 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
IoT Middleware: A Survey on Issues and Enabling technologies
Ngu, A. H. H., Gutierrez, M., Metsis, V., Nepal, S., & Sheng, M. Z. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2615180 · Cited by 681
A Calculus for Cryptographic Protocols: The Spi Calculus
Abadi, M., & Gordon, A. D. (1999) · Information and Computation · doi:10.1006/inco.1998.2740 · Cited by 668
Self-citation
Metadata
- Authors
- Burrows, M., Abadi, M., & Needham, R. M.
- Venue
- Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences
- Publisher
- The Royal Society
- Published
- 1989-12-08
- Volume
- 426
- Issue
- 1871
- Pages
- 233-271
- ISSN
- 0080-4630 (ISSN-L)
- 2053-9169
- OpenAlex
- W2175661655
- Cited by
- 639
- References
- 5
- FWCI
- 1.49
- Type
- journal article
- 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.