The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Using encryption for authentication in large networks of computers
Open accessAbstract
Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of authenticated mail, and for signature verification and document integrity guarantee. Both conventional and public-key encryption algorithms are considered as the basis for protocols.
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
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
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
Encryption Protection in Computer Data Communications
Branstad, D. K. (1975) · Cited by 33
Encryption-based protection for interactive user/computer communication
Kent, S. (1977) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/800103.803345 · Cited by 29
ENCRYPTION-BASED PROTECTION PROTOCOLS FOR INTERACTIVE USER-COMPUTER COMMUNICATION
Kent, S. (1976) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 19
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
Self-citationPervasive computing: vision and challenges
Satyanarayanan, M. (2001) · IEEE Personal Communications · doi:10.1109/98.943998 · Cited by 2,419
Metadata
- Authors
- Needham, R. M., & Schroeder, M. D.
- Venue
- Communications of the ACM
- Published
- 1978-12
- Volume
- 21
- Issue
- 12
- Pages
- 993-999
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2146973388
- Cited by
- 2,362
- References
- 6
- FWCI
- 19.80
- Type
- journal article
- Language
- en
- Open access
- bronze
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.