The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Multiuser cryptographic techniques
Abstract
This paper deals with new problems which arise in the application of cryptography to computer commu-nication systems with large numbers of users. Fore-most among these is the key distribution problem. We suggest two techniques for dealing with this problem. The first employs current technology and requires sub-version of several separate key distribution nodes to compromise the system's security. Its disadvantage is a high overhead for single message connections. The second technique is still in the conceptual phase, but promises to eliminate completely the need for a secure key distribution channel, by making the sender's key-ing information public. It is also shown how such a public key cryptosystem would allow the development of an authentication system which generates an un-forgeable, message dependent digital signature.
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
Self-citationCryptography and Computer Privacy
Feistel, H. (1973) · Scientific American · doi:10.1038/scientificamerican0573-15 · Cited by 777
A user authentication scheme not requiring secrecy in the computer
Evans, A., Kantrowitz, W., & Weiss, E. (1974) · Communications of the ACM · doi:10.1145/361082.361087 · Cited by 174
A high security log-in procedure
Purdy, G. (1974) · Communications of the ACM · doi:10.1145/361082.361089 · Cited by 142
Cited by
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Self-citationHandbook 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
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
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Metadata
- Authors
- Diffie, W., & Hellman, M. E.
- Venue
- Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76
- Publisher
- ACM Press
- Published
- 1976
- Pages
- 109
- OpenAlex
- W2003647955
- Cited by
- 270
- References
- 4
- FWCI
- 4.24
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multiuser cryptographic techniques. https://app.cochat.ai/papers/10.1145/1499799.1499815
- The paper
- Diffie, W., & Hellman, M. E. (1976). Multiuser cryptographic techniques. Proceedings of the June 7-10, 1976, national computer conference and exposition on - AFIPS '76. https://doi.org/10.1145/1499799.1499815
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.