The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An overview of PKI trust models
Abstract
If Alice and Bob each know their own private key and the other's public key, they can communicate securely, through any number of public key based protocols such as IPSec, PGP, S/MIME, or SSL. However, how do they know each other's public keys? The goal of a public key infrastructure (PKI) is to enable secure, convenient, and efficient discovery of public keys. It should be applicable within as well as between organizations, and scalable to support the Internet. There are various types of PKI that are widely deployed or have been proposed. They differ in the configuration information required, trust rules, and flexibility. There are standards such as X.509 and PKIX, but these are sufficiently flexible so that almost any model of PKI can be supported. We describe several types of PKI and discuss the advantages and disadvantages of each. We argue against several popular and widely deployed models as being insecure, unscalable, or overly inconvenient. We also recommend a particular model.
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
Security Architecture for the Internet Protocol
Kent, S., & Atkinson, R. (1998) · doi:10.17487/rfc2401 · Cited by 891
Internet X.509 Public Key Infrastructure Certificate and CRL Profile
Housley, R., Ford, W., Polk, W., & Solo, D. (1999) · doi:10.17487/rfc2459 · Cited by 837
Network Security: Private Communication in a Public World
Kaufman, C., Perlman, R., & Speciner, M. (1995) · Cited by 730
Self-citationCallas, J., Donnerhacke, L., Finney, H., & Thayer, R. (1998) · doi:10.17487/rfc2440 · Cited by 514
Domain Name System Security Extensions
Eastlake, D., & Kaufman, C. (1997) · doi:10.17487/rfc2065 · Cited by 319
Privacy Enhancement for Internet Electronic Mail: Part II: Certificate-Based Key Management
Kent, S. (1993) · doi:10.17487/rfc1422 · Cited by 191
The Digital Distributed System Security Architecture
Gasser, M., Goldstein, A., Kaufman, C., & Lampson, B. (1989) · Cited by 186
Cited by
A Survey on Cyber Security for Smart Grid Communications
Yan, Y., Qian, Y., Sharif, H., & Tipper, D. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.010912.00035 · Cited by 716
Providing robust and ubiquitous security support for mobile ad-hoc networks
Jiej, Petros, Z., Luo, H., Lu, S., & Zhang, L. (2001) · Proceedings Ninth International Conference on Network Protocols ICNP 2001 ICNP-01 · doi:10.1109/icnp.2001.992905 · Cited by 688
Self-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications · doi:10.1109/iscc.2002.1021731 · Cited by 358
RBAC-SC: Role-Based Access Control Using Smart Contract
Cruz, J. P., Kaji, Y., & Yanai, N. (2018) · IEEE Access · doi:10.1109/access.2018.2812844 · Cited by 351
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
Metadata
- Authors
- Perlman, R.
- Venue
- IEEE Network
- Published
- 1999
- Volume
- 13
- Issue
- 6
- Pages
- 38-43
- ISSN
- 0890-8044 (ISSN-L)
- OpenAlex
- W2116726174
- Cited by
- 283
- References
- 7
- FWCI
- 6.18
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An overview of PKI trust models. https://app.cochat.ai/papers/10.1109/65.806987
- The paper
- Perlman, R. (1999). An overview of PKI trust models. IEEE Network. https://doi.org/10.1109/65.806987
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.