Digital signature

Bind a specific message to a specific private-key holder with a short string anyone can check against the public key, confining all remaining trust to one question — does this public key authentically belong to its claimed principal?

Version

v3 · 2026-09-28 · History · 4 corrections

Domain-specific #

274

Domain group

Applied Sciences & Engineering

Origin domain

Computer Science & Software Engineering

Subdomain

Cryptography Security → Computer Science & Software Engineering

Core Idea

A digital signature binds a specific message to a specific private-key holder in a form any party with the matching public key can verify. The holder signs over the message's hash, producing a short string checkable without any shared secret. Three guarantees follow: authenticity (only the keyholder could produce it), integrity (any modification invalidates it), and non-repudiation (the signer cannot disown it). It presupposes a public-key infrastructure binding keys to principals.

How would you explain it like I'm…

The Secret Stamp

A digital signature is like a magic stamp that only you can make, but everyone has a checker that tells if the stamp is really yours. If anyone changes even one word of your note after you stamp it, the checker says "no match." But people first need to be sure the checker they have really belongs to you.

Secret Key Signature

A digital signature is a way to 'sign' a computer message so anyone can check it really came from you. You keep a secret key that only you have, and you share a public key with everyone. Your secret key makes a short code for that exact message, and anyone can use your public key to check the code without ever learning your secret. If the message is changed even a little, the check fails. But it only proves who you are if people are sure the public key really belongs to you.

Public-Key Signature

A digital signature uses a matched pair of keys: a private key the signer keeps secret and a public key anyone can have. The signer runs a signing algorithm over the message (usually over a hash, a short fingerprint of the message) to produce a signature, and anyone with the public key can verify it without knowing any secret. This gives three guarantees: authenticity (only the private-key holder could make it), integrity (any change to the message breaks it), and non-repudiation (the signer can't credibly deny signing). Unlike a shared password, the checker never holds anything that would let them forge a signature. The weak point is usually not the math but knowing which public key truly belongs to which person, which is the job of a public-key infrastructure.

 

A digital signature binds a specific message to the holder of a specific private key in a way anyone holding the matching public key can verify. It is built from a public-key cryptosystem such as RSA, ECDSA or Ed25519 together with a collision-resistant hash function: the signer hashes the message and applies the private-key signing operation to produce a short signature. Verification is a deterministic check using only the public key, so no shared secret is needed. The construction yields authenticity, integrity (the signature was computed over the original, so any modification invalidates it) and non-repudiation (only the private-key holder could have signed). It also presupposes a public-key infrastructure that lets verifiers obtain the authentic public key for a claimed signer; without that, a verifiable signature is not tied to any real-world identity. Notable real failures, such as the DigiNotar compromise and the Symantec distrust events, happened in the certificate-authority and key-management layer rather than in the cryptographic primitive. Digital signatures underpin TLS certificate validation, code signing, SSH host authentication, signed updates and blockchain transaction authorization.

Scope of Application

The digital signature lives across cryptography, security, and distributed systems; wherever public-key cryptography, a hash, and a PKI are available, the same construction is reused literally.

• TLS and certificate validation — a CA signs certificates and the server signs the handshake.
• Code signing and software updates — signed binaries verified for authorship and integrity before execution.
• SSH and host authentication — host keys binding a session to the private-key holder.
• Blockchain transaction authorization — only the keyholder can move funds.
• Consensus and authenticated protocols — validator signatures and certificate-transparency log commitments reduce to signature checks; Signal signs only its prekeys and authenticates messages without signatures, to stay deniable.
• Digital legal instruments — advanced and qualified electronic signatures under eIDAS, and cryptographically made e-signatures under ESIGN.

Clarity

Naming the signature separates two goals that share a toolchain: secrecy and authenticity. Encryption hides contents; a signature says who produced a message and whether it was altered. The sharper clarity is about where trust lives — since verification is a deterministic algebraic check, the whole social-trust problem collapses to one residual question: does this public key authentically belong to its principal?

Manages Complexity

Distributed trust is, raw, an unbounded social problem: for every artifact, satisfy that the sender is genuine, the bytes unaltered, the sender unable to disown them. The signature collapses that sprawl to one machine-decided check plus one residual scalar — the key-binding question. Failures sort cleanly into broken math (rare) or broken key-binding (the common case: a breached CA, a leaked key).

Abstract Reasoning

The construction licenses boundary-drawing (is the need secrecy or authenticity, and which of the three guarantees applies), diagnostic reasoning (sorting failures into primitive-level versus key-binding breaks by elimination), interventionist reasoning (hardening the PKI layer rather than the cipher), and conditional inference that withholds the identity guarantee absent a sound key-binding.

Knowledge Transfer

Within cryptography and distributed systems the construction transfers as mechanism, literally — the same algebraic object reused across TLS, code-signing, SSH, and blockchain. Beyond PKI settings only the abstract pattern travels: the parent Attestation — a verifiable, principal-binding, tamper-evident mark checkable by a third party — of which wax seals and notary stamps are co-instances. Export the three-guarantees checklist; the cryptographic machinery stays home.

Relationships to Other Abstractions

Current abstraction Digital signature Domain-specific

Parents (5) — outgoing typed relations

• Digital signature is a kind of Public-Key Cryptography Domain-specific

  A Digital Signature is the sign-and-publicly-verify species of Public-Key Cryptography, using the private key to produce and the public key to check.

• Digital signature is a kind of Attestation Prime

  A Digital Signature is Attestation implemented with a private-key mark, public-key trust anchor, message digest, and deterministic public check.

• Digital signature presupposes, typical Cryptographic Hash Function Domain-specific

  Digital signatures typically presuppose a collision-resistant Cryptographic Hash Function that binds a bounded signing operation to the exact message.

• Digital signature includes Verification Prime

  A Digital Signature strictly contains Verification as the public procedure that checks the mark-message-key relation and returns valid or invalid.

• Digital signature is a decomposition of Capability Separation Prime

  Removing cryptographic machinery leaves restricted issuance, open verification, and a forgery barrier that checking does not confer.

Hierarchy paths (8) — routes to 4 parentless roots

• Digital signature → is a kind of Public-Key Cryptography → includes, conditional Encryption → is a kind of Encoding And Decoding → includes Transformation → is a kind of, typical Function (Mapping)

Show alternative paths (7)

Neighborhood in Abstraction Space

Digital signature sits in a sparse region of the domain-specific corpus (68^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

• Public-Key Cryptography — 0.88
• Encryption — 0.85
• Proof-Carrying Code — 0.84
• Message Authentication Code — 0.83
• Secure Channel — 0.82

Computed from structural-signature embeddings · 2026-10-25