How to time-stamp a digital document
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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 procedures maintain complete privacy of the documents themselves, and require no record-keeping by the time-stamping service.
- J. Alter. When photographs lie. Newsweek, pp. 44–45, July 30, 1990.
- Blum, M., Micali, S. (Nov. 1984) How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13: pp. 850-864
- G. Brassard and M. Yung. One-way group actions. In Advances in Cryptology—Crypto '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.
- Damgård, I. (1988) Collision-free hash functions and public-key signature schemes. Advances in Cryptology—Eurocrypt '87. Springer-Verlag, Berlin, pp. 203-217
- Damgård, I. A design principle for hash functions. In: Brassard, G. eds. (1990) Advances in Cryptology—Crypto '89. Springer-Verlag, Berlin, pp. 416-427
- A. DeSantis and M. Yung. On the design of provably secure cryptographic hash functions. In Advances in Cryptology—Eurocrypt '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.
- Diffie, W., Hellman, M. E. (Nov. 1976) New directions in cryptography. IEEE Trans. Inform. Theory 22: pp. 644-654
- Z. Galil, S. Haber, and M. Yung. Interactive public-key cryptosystems. Submitted for publication, 1990.
- Goldwasser, S., Micali, S. (April 1984) Probabilistic encryption. J. Comput. System Sci. 28: pp. 270-299
- Goldwasser, S., Micali, S., Rivest, R. (1988) A secure digital signature scheme. SIAM J. Comput. 17: pp. 281-308
- A. Grundberg. Ask it no questions: The camera can lie. The New York Times, Section 2, pp. 1, 29, August 12,1990.
- Impagliazzo, R., Levin, L., Luby, M. (1989) Pseudorandom generation from one-way functions. Proc. 21st STOC. ACM, New York, pp. 12-24
- Impagliazzo, R., Luby, M. (1989) One-way functions are essential for complexity-based cryptography. Proc. 30th FOCS. IEEE, New York, pp. 230-235
- Kanare, H. M. (1985) Writing the Laboratory Notebook. American Chemical Society, Washington, D.C.
- R. C. Merkle. Secrecy, authentication, and public-key systems. Ph.D. thesis, Stanford University, 1979.
- Merkle, R. C. One-way hash functions and DES. In: Brassard, G. eds. (1990) Advances in Cryptology-3-Crypto '89. Springer-Verlag, Berlin, pp. 428-446
- Naor, M., Yung, M. (1989) Universal one-way hash functions and their cryptographic applications. Proc. 21st STOC. ACM, New York, pp. 33-43
- Rabin, M. O. Digitalized signatures. In: DeMillo, R. A. eds. (1978) Foundations of Secure Computation. Academic Press, New York, pp. 155-168
- R. Rivest. The MD4 message digest algorithm. In Advances in Cryptology—Crypto '90. Lecture Notes in Computer Science, Springer-Verlag, Berlin, to appear.
- Rompel, J. (1990) One-way functions are necessary and sufficient for secure signatures. Proc. 22nd STOC. ACM, New York, pp. 387-394
- Shannon, C. (1951) Prediction and entropy of printed English. Bell System Tech. J. 30: pp. 50-64
- Yao, A. C. (1982) Theory and applications of trapdoor functions. Proc. 23rd FOCS. IEEE, New York, pp. 80-91
- How to time-stamp a digital document
Journal of Cryptology
Volume 3, Issue 2 , pp 99-111
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors