The DOI matches its Crossref record.
A semantics for a logic of authentication (extended abstract)
Abstract
Burrows, Abadi, and Needham have proposed a logic for the analysis of authentication protocols. It is a logic of belief, with special constructs for expressing some of the central concepts used in authentication. The logic has revealed many subtleties and serious errors in published protocols. Unfortunately, it has also created some confusion. In this paper, we provide a new semantics for the logic, our attempt to clarify its meaning. In the search for a sound semantics, we have identi ed many sources of the past confusion. Identifying these sources has helped us improve the logic's syntax and inference rules, and extend its applicability. One of the greatest di erences between our semantics and the original semantics is our treatment of belief as a form of resource-bounded, defeasible knowledge. 1
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
Cited by
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
A semantic model for authentication protocols
Woo, T. Y. C., & Lam, S. S. (2002) · Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1993.287633 · Cited by 300
On unifying some cryptographic protocol logics
Syverson, P. F., & van Oorschot, P. C. (2002) · Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1994.296595 · Cited by 273
On the (im)possibility of perennial message recognition protocols without public-key cryptography
González Muñiz, M., & Laud, P. (2011) · Proceedings of the 2011 ACM Symposium on Applied Computing · doi:10.1145/1982185.1982508 · Cited by 5
Metadata
- Authors
- Abadi, M., & Tuttle, M. R.
- Venue
- Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91
- Publisher
- ACM Press
- Published
- 1991
- Pages
- 201-216
- OpenAlex
- W2077025369
- Cited by
- 219
- References
- 0
- FWCI
- 5.15
- 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.