How to time-stamp a digital document

@article{Haber2004HowTT,
  title={How to time-stamp a digital document},
  author={Stuart Haber and W. Scott Stornetta},
  journal={Journal of Cryptology},
  year={2004},
  volume={3},
  pages={99-111}
}
The prospect of a world in which all text, audio, picture, and video documents are in digital form on easily modifiable media raises the issue of how to certify when a document was created or last changed. The problem is to time-stamp the data, not the medium. We propose computationally practical procedures for digital time-stamping of such documents so that it is infeasible for a user either to back-date or to forward-date his document, even with the collusion of a time-stamping service. Our… 
A Multi-Signature For Time Stamping Scheme
TLDR
A distributed time-stamping scheme which is more robust against a denial of service attack and based on a multisignature scheme, with the interesting point is that the size of the time-Stamp token does not depend on l and that there is no publication process.
Enabling the Archival Storage of Signed Documents
TLDR
KASTS combines time stamping of signed documents with storage of past signature verification keys and is argued that such an extended archival storage system is feasible and one possible design for it is described.
Long-term preservation of digital signatures for multiple groups of related documents
TLDR
This study presents a solution extending ERS and providing a functionality that enables proof of the existence of a document group over a long period (multiple rounds).
Digital signature: does it really work for electronic documents?
TLDR
This paper has examined the space of such attacks, and has described how many popular electronic document formats and PKI packages permit them.
A Digital Standard Time Dissemination Architecture for Trustworthy Time Stamping
TLDR
A delegation time stamping mechanism is implemented with a forward-secure proxy signature scheme to provide digital time stamps with enhanced validity assurance and with digital time traceability to the national standard.
Design requirements for a secure time-stamping scheme
TLDR
The relationship and interaction between time and cryptography is analyzed by analyzing all currently available state-of-the-art time-stamping schemes by listing a set of design requirements and properties that software developers should consider when implementing secure time-Stamping services.
A Content Integrity Service For Long-Term Digital Archives
TLDR
An efficient and secure Content Integrity Service (CIS) that solves this problem, which is designed and implemented as a service on the Digital Media Platform (DMP) and relies on one-way hashing and digital time-stamping procedures.
A survey of the problems of time-stamping or why it is necessary to have another time-stamping scheme
TLDR
The paper aims to propose one possibility to overcome the current dead-end in achieving highly secure time-stamping schemes and tries to put the advantages and disadvantages of the different available time-Stamping schemes in perspective.
Authentic Time-Stamps for Archival Storage
TLDR
In this work, a space efficient local data structure encapsulates a full document repository in a short digest, allowing for efficient proofs of existence and non-existence, improving on state-of-the-art techniques.
...
...

References

SHOWING 1-10 OF 30 REFERENCES
The MD5 Message-Digest Algorithm
The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest", in such a way that it is (hopefully) computationally
Collision Free Hash Functions and Public Key Signature Schemes
TLDR
The ability of a hash function to improve security and speed of a signature scheme is discussed: for example, it can combine the RSA-system with a collision free hash function based on factoring to get a scheme which is more efficient and much more secure.
Writing the Laboratory Notebook
The Reasons for Notekeeping: An Overview The Hardware of Notekeeping: Books, Pens, and Paper Legal and Ethical Aspects: Ownership, Rights, and Obligations Management of Notekeeping: Practices for
One-way functions are essential for complexity based cryptography
  • R. Impagliazzo, M. Luby
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
It is shown that many of the standard cryptographic tasks are equivalent to the usual definition of a one-way function, and thus the security of any proposed protocol for these tasks is implicitly based on a function being 'one-way.
A Design Principle for Hash Functions
TLDR
Apart from suggesting a generally sound design principle for hash functions, the results give a unified view of several apparently unrelated constructions of hash functions proposed earlier, and suggests changes to other proposed constructions to make a proof of security potentially easier.
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
TLDR
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.
Universal one-way hash functions and their cryptographic applications
TLDR
A Universal One-Way Hash Function family is defined, a new primitive which enables the compression of elements in the function domain and it is proved constructively that universal one- way hash functions exist if any 1-1 one-way functions exist.
New directions in cryptography
TLDR
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
One-way functions are necessary and sufficient for secure signatures
  • J. Rompel
  • Computer Science, Mathematics
    STOC '90
  • 1990
TLDR
This paper is interested in signature schemes which are secure agMnst existential forgery under adaptive chosen message attacks, and the existence of trapdoor permutations can be shown to be necessary and sufficient for secure encryption schemes.
Probabilistic Encryption
...
...