The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Kerberos: an authentication service for computer networks
Abstract
When using authentication based on cryptography, an attacker listening to the network gains no information that would enable it to falsely claim another's identity. Kerberos is the most commonly used example of this type of authentication technology. The authors concentrate on authentication for real-time, interactive services that are offered on computer networks. They use the term real-time loosely to mean that a client process is waiting for a response to a query or command so that it can display the results to the user, or otherwise continue performing its intended function. This class of services includes remote login, file system reads and writes, and information retrieval for applications like Mosaic.>
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
The Kerberos Network Authentication Service (V5)
Neuman, C., Yu, T., Hartman, S., & Raeburn, K. (2005) · doi:10.17487/rfc4120 · Cited by 1,052
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
Timestamps in key distribution protocols
Denning, D. E., & Sacco, G. M. (1981) · Communications of the ACM · doi:10.1145/358722.358740 · Cited by 682
The Kerberos Network Authentication Service (V5)
Kohl, J., & Neuman, C. (1993) · doi:10.17487/rfc1510 · Cited by 514
Limitations of the Kerberos authentication system
Bellovin, S. M., & Merritt, M. (1990) · ACM SIGCOMM Computer Communication Review · doi:10.1145/381906.381946 · Cited by 255
Proxy-based authorization and accounting for distributed systems
Neuman, B. C. (2002) · [1993] Proceedings. The 13th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1993.287698 · Cited by 237
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
A pairwise key pre-distribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., & Varshney, P. K. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948118 · Cited by 1,107
The Kerberos Network Authentication Service (V5)
Neuman, C., Yu, T., Hartman, S., & Raeburn, K. (2005) · doi:10.17487/rfc4120 · Cited by 1,052
A pairwise key predistribution scheme for wireless sensor networks
Du, W., Deng, J., Han, Y. S., Varshney, P. K., Katz, J., & Khalili, A. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1065545.1065548 · Cited by 1,038
A key management scheme for wireless sensor networks using deployment knowledge
Du, W., Deng, J., Han, Y. S., Chen, S., & Varshney, P. K. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354530 · Cited by 919
Metadata
- Authors
- Neuman, B. C., & Ts'o, T.
- Venue
- IEEE Communications Magazine
- Published
- 1994-09
- Volume
- 32
- Issue
- 9
- Pages
- 33-38
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2106539366
- Cited by
- 1,337
- References
- 10
- FWCI
- 22.02
- Type
- journal article
- 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.