The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Trust relationships in secure systems-a distributed authentication perspective
Abstract
The notion of trust is fundamental in inter-domain authentication protocols. The goal is to develop an effective formalism for explicit expressions of trust relations between entities involved in authentication protocols. Different relevant types of trust are identified and classified. A formalism for expressing trust relations is presented along with an algorithm for deriving trust relations from recommendations. The advantages of the approach are demonstrated by analyzing and comparing the trust relation requirements of a few known authentication 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
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
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
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
Kerberos: An Authentication Service for Open Network Systems
Steiner, J. G., Athena, Neuman, C., & Schiller, J. I. (1988) · Cited by 1,014
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
Reasoning about belief in cryptographic protocols
Gong, L., Needham, R., & Yahalom, R. (1990) · Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1990.63854 · Cited by 628
Self-citationAuthentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
Efficient and timely mutual authentication
Otway, D., & Rees, O. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/24592.24594 · Cited by 335
Research works printed but not linked: 8
- gligor, 1992, On Inter-realm Authentication in Large Distributed Systems, Proceedings of the IEEE Conference on Security and Privacy, 2
- horster, 1992, Cryptographic Protocols and Network Security, Proc IFIP/SEC
- 10.1145/24592.24593 · doi:10.1145/24592.24593
- miller, 1987, Kerberos authentication and authorization system
- beth, 1991, TESS - The Exponential Security System
- 10.1109/SP.1986.10009 · doi:10.1109/sp.1986.10009
- 1988, The Directory - Authentication Framework, IX Plenary Assembly
- 1989, ACM Operating Systems Review, 23
Cited by
Abdul-Rahman, A., & Hailes, S. (1997) · Proceedings of the 1997 workshop on New security paradigms - NSPW '97 · doi:10.1145/283699.283739 · Cited by 699
Modelling a public-key infrastructure
Maurer, U. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61770-1_45 · Cited by 324
Dellarocas, C. N. (2001) · SSRN Electronic Journal · doi:10.2139/ssrn.289967 · Cited by 25
Metadata
- Authors
- Yahalom, R., Klein, B., & Beth, T.
- Venue
- Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-30
- Pages
- 150-164
- OpenAlex
- W2125173879
- Cited by
- 263
- References
- 16
- FWCI
- 29.93
- 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: Trust relationships in secure systems-a distributed authentication perspective. https://app.cochat.ai/papers/10.1109/risp.1993.287635
- The paper
- Yahalom, R., Klein, B., & Beth, T. (2002). Trust relationships in secure systems-a distributed authentication perspective. Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy. https://doi.org/10.1109/risp.1993.287635
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.
