Skip to content

Linked Timestamping

Make digital timestamp evidence interdependent through authenticated links, so later changes to the recorded sequence become detectable under stated trust assumptions.

Version
v1 · 2026-10-31 · History
Domain-specific #
14530
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomains
Cryptographic Timestamping, Tamper Evident Logs → Computer Science & Software Engineering
Aliases
Linked digital timestamping, Cryptographically linked timestamp tokens

Core Idea

Linked timestamping makes timestamp evidence for digital records depend cryptographically on earlier certificates or batch commitments. A verifier can follow those links to detect a changed record that no longer matches the later evidence, provided the hash, authentication, witnesses and proof path remain trustworthy. The original Haber–Stornetta scheme used signed linked certificates; linkage does not inherently replace signatures.[1]

How would you explain it like I'm…

Chain of Matching Links

Imagine a chain of paper links where each new link has a little bit of the link before it written on it. If someone sneaks back and changes an old link, the newer links won't match anymore, so you can tell. Linked timestamping does this with computer records to show which came first.

Linked Time Stamps

Linked timestamping is a way for computers to prove that a piece of data existed by a certain point and in what order things happened. Each new timestamp includes a special code made from the one before it, so they're linked like a chain. If someone later changes an old record without redoing everything after it, a checker can spot the mismatch. It shows things were changed, rather than making change impossible, and to know the actual date you still need a trusted outside clock or public record.

Hash-Chained Timestamp Evidence

Linked timestamping creates digital proof that data existed by some point, with each timestamp cryptographically depending on earlier ones. In the simple version, each new certificate includes information (like a hash) from the previous one; in batched versions, many records are combined into a hash tree whose root is bound into the ongoing chain. A verifier can follow the links and detect if someone changed an earlier record without recreating everything that depends on it. This is tamper evidence under certain assumptions — the strength of the hash functions, keeping the verification path, trustworthy witnesses — not unbreakable permanence. The chain shows relative order; proving an absolute date needs an external anchor, like a publicly published value. And a timestamp only shows that certain bytes were fixed by then, not that they're true, who wrote them, or when they were first created.

 

Linked timestamping issues digital evidence of existence or ordering such that each timestamp certificate, token or batch commitment is cryptographically dependent on earlier evidence. In a linear scheme, a new certificate commits to information from its predecessor; in batched variants, many record digests feed a hash-tree root that is bound into the continuing chain. A verifier tracing the relevant links can detect inconsistency if a recorded item is later altered without regenerating the dependent evidence. The guarantee is tamper evidence under assumptions — the security of the hash and authentication mechanisms, retention of verification paths, the trustworthiness or independence of witnesses, and any externally published anchor — not absolute immutability. Haber and Stornetta's original work aimed to make back- or forward-dating computationally infeasible even against certain issuer collusion, and their linked design used signed certificates, so linkage does not categorically replace signatures or PKI. The chain orders commitments relative to one another; absolute dating requires a time source, witnessed publication or other external anchor. Even then, a sound commitment shows only that specified bytes or their digest were fixed no later than the anchor, not their truth, authorship or original creation time.

Scope of Application

Haber and Stornetta's 1991 certificate carried sequence, time, client ID, record hash and information from the preceding certificate; a successor client's certificate could then corroborate the challenged record. Bayer, Haber and Stornetta's later hash-tree design let \(N\) record digests share one public root while each holder kept roughly \(\log_2 N\) sibling hashes and their left/right positions. Long-term archival records add renewal obligations. A blockchain may use linkage but additionally requires its own ledger and consensus assumptions.[1][2][3]

Clarity

A link constrains relative order: later evidence commits to earlier evidence. An absolute date claim additionally needs a trustworthy clock, witness or published anchor. Even then, the proof concerns the committed bytes and their existence no later than an established time; it does not prove that their contents are true, who authored them, or the exact moment they were created.[1][2]

Manages Complexity

Interdependent certificates make an old change inconsistent with later evidence instead of leaving every timestamp isolated. A hash tree can compress a batch into one root, but a future verifier must retain the leaf-to-root path, successor links and time anchor. Cryptographic weakening or lost verification material can defeat long-lived evidence unless renewal is planned.[2][3]

Abstract Reasoning

Identify the record digest, certificate or token contents, exact prior commitment being authenticated, and any batch proof path. State the adversary and trust assumptions. Recompute the digest and links; verify signatures or publications where used; then draw only the time bound justified by the anchor. A standalone independently signed timestamp is a near miss because it lacks inter-token dependency.[1][3]

Knowledge Transfer

Linear certificate chains, batched timestamp trees and archival evidence sequences share authenticated dependence among evidence items, although their trust and renewal details differ. A standalone trusted timestamp need not link to prior evidence; a hash chain alone need not establish a time claim. Blockchain is a related architecture, not a required synonym. A commitment does not by itself establish exact creation time or legal force.

Neighborhood in Abstraction Space

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

Family — Information Control & Disclosure Failures (6 abstractions)

Nearest neighbors

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

References

[1] Haber and Stornetta, “How to Time-Stamp a Digital Document,” Journal of Cryptology 3 (1991), 99–111; accessible transcription, §§4.2–5.1. The transcription states minor editorial differences from the journal version. registry ↩a ↩b ↩c ↩d

[2] Bayer, Haber and Stornetta, “Improving the Efficiency and Reliability of Digital Time-Stamping,” Sequences II (1993); authors’ paper mirror. Hash-tree batching and linked evidence. registry ↩a ↩b ↩c

[3] Gondrom, Brandner and Pordesch, “Evidence Record Syntax,” RFC 4998 (2007). Official archive timestamp-chain, hash-tree and renewal specification. registry ↩a ↩b ↩c