The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Reasoning about belief in cryptographic protocols
Abstract
A mechanism is presented for reasoning about belief as a systematic way to understand the working of cryptographic protocols. The mechanism captures more features of such protocols than that given by M. Burrows et al. (1989) to which the proposals are a substantial extension. The notion of possession incorporated in the approach assumes that principles can include in messages data they do not believe in, but merely possess. This also enables conclusions such as 'Q possesses the shared key', as in an example to be derived. The approach places a strong emphasis on the separation between the content and the meaning of messages. This can increase consistency in the analysis and, more importantly, introduce the ability to reason at more than one level. The final position in a given run will depend on the level of mutual trust of the specified principles participating in that run.>
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
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
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
Self-citationUsing 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
Self-citationKnowledge and common knowledge in a distributed environment
Halpern, J. Y., & Moses, Y. (1990) · Journal of the ACM · doi:10.1145/79147.79161 · Cited by 955
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_40 · Cited by 872
Burrows, M., Abadi, M., & Needham, R. (1989) · Proceedings of the twelfth ACM symposium on Operating systems principles · doi:10.1145/74850.74852 · Cited by 641
Self-citationReducing 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
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Supporting trust in virtual communities
Abdul-Rahman, A., & Hailes, S. (2005) · Proceedings of the 33rd Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.2000.926814 · Cited by 1,339
Secure Routing in Mobile Ad hoc Networks
(2022) · doi:10.22271/ed.book.2027 · Cited by 1,227
Valuation of trust in open networks
Beth, T., Borcherding, M., & Klein, B. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58618-0_53 · Cited by 652
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
Metadata
- Authors
- Gong, L., Needham, R., & Yahalom, R.
- Venue
- Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy
- Publisher
- IEEE
- Published
- 1990
- Pages
- 234-248
- OpenAlex
- W2102922499
- Cited by
- 628
- References
- 9
- FWCI
- 7.55
- 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.