Web of Trust¶
A decentralized OpenPGP authentication model in which a relying party combines peer certifications of key–identity bindings with locally assigned introducer trust to determine which bindings it will treat as valid.
Core Idea¶
A web of trust is a decentralized authentication model associated with PGP, GnuPG, and OpenPGP. Its object is not a message but a binding between an OpenPGP public key and an identity claim, usually a User ID. Participants issue certification signatures after whatever identity check their certification policy requires. Each relying party then decides which certifiers count as trusted introducers and applies a local validation policy to the resulting certification graph. The output is a locally accepted or rejected key–identity binding.
Scope of Application¶
The home domain is OpenPGP public-key authentication. Canonical applications include selecting a recipient key for encrypted mail, deciding whether a document or software signature is attributable to a claimed signer, and authenticating contributor keys within communities that exchange certification signatures.
The model applies to OpenPGP certificates containing primary keys, User IDs, self-signatures, third-party certifications, and revocations. RFC 9580 standardizes the packet meanings, including certification types and trust-signature subpackets, while deliberately leaving final validity authority with the receiver. Implementations supply the local trust database and policy mechanics. GnuPG's classic model is an important implementation, not the whole definition.
Clarity¶
A recognition test asks:
- Is the target a public-key-to-identity binding rather than a message or authorization decision? 2. Are third parties able to issue cryptographically verifiable certifications of that binding? 3. Does a relying party choose one or more local starting points? 4. Does it separately assess which certifiers may introduce other keys? 5. Is there a rule for combining admissible certifications into a validity verdict?
Manages Complexity¶
Public-key cryptography moves a security problem rather than eliminating it. A verifier can check that a signature was produced by the private key corresponding to a public key, but still must learn whose key it is. Directly verifying every correspondent's fingerprint scales poorly. Blindly importing a key from a server merely authenticates transport or storage, not the claimed owner.
Abstract Reasoning¶
The web can be modeled as a directed labeled graph. Nodes represent OpenPGP primary keys or certified identities. A directed certification edge from key A to key B's User ID states that A's controller issued a certification over the B–User-ID binding. Local ownertrust is a relying-party-specific label on possible introducer nodes. Validity is a function:
Knowledge Transfer¶
The exact pattern transfers within cryptographic identity systems when five elements remain intact: signed identity bindings, independently chosen trust anchors, delegated introducer authority, path-sensitive evidence combination, and local validity verdicts. This helps compare PGP's classic model with scoped trust signatures, organizational OpenPGP certification practices, and experimental decentralized PKIs.
Outside cryptography, the graph skeleton can illuminate peer credentialing, academic citation, or referral networks, but those are analogies unless they also provide tamper-evident certifications and a verifier-specific binding decision. The portable residue already belongs to Authentication, Attestation, Trust, delegation, thresholding, and graph reachability.
Relationships to Other Abstractions¶
Current abstraction Web of Trust Domain-specific
Parents (1) — more general patterns this builds on
-
Web of Trust is a kind of Authentication Prime
Authentication is the strongest parent.
Hierarchy path (1) — routes to 1 parentless root
- Web of Trust → Authentication
Neighborhood in Abstraction Space¶
Web of Trust sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Administrative Distance — 0.79
- Temperley–Lieb Algebra — 0.79
- Digital signature — 0.79
- Authentication Failure — 0.79
- Mobile Virtual Private Network — 0.79
Computed from structural-signature embeddings · 2026-09-08