The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the security of public key protocols
Abstract
Recently the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message. It has been pointed out, however, that an improperly designed protocol could be vulnerable to an active saboteur, one who may impersonate another user or alter the message being transmitted. Several models are formulated in which the security of protocols can be discussed precisely. Algorithms and characteri-zations that can be used to determine protocol security in these models are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Protection in operating systems
Harrison, M. A., Ruzzo, W. L., & Ullman, J. D. (1976) · Communications of the ACM · doi:10.1145/360303.360333 · Cited by 1,042
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
Self-citationFoundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Multiuser cryptographic techniques
Diffie, W., & Hellman, M. E. (1976) · Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76 · doi:10.1145/1499799.1499815 · Cited by 270
A Linear Time Algorithm for Deciding Subject Security
Lipton, R. J., & Snyder, L. (1977) · Journal of the ACM · doi:10.1145/322017.322025 · Cited by 201
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
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
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
A Digital Twin Based Industrial Automation and Control System Security Architecture
Gehrmann, C., & Gunnarsson, M. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2938885 · Cited by 353
Metadata
- Authors
- Dolev, D., & Yao, A. C.
- Venue
- 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- Publisher
- IEEE
- Published
- 1981-10
- Pages
- 350-357
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2039875296
- Cited by
- 478
- References
- 11
- FWCI
- 2.32
- 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.