How to time-stamp a digital document

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 537 LNCS, Issue , 1991, Pages 437-455

  Haber, Stuart ^a   Scott Stornetta, W ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; RECORDS MANAGEMENT;

DIGITAL DOCUMENTS; DIGITAL FORMS; PRACTICAL PROCEDURES; RECORD KEEPING; TIME STAMPS; TIME-STAMPING SERVICE; TIMESTAMPING; VIDEO DOCUMENTS;

STAMPING;

EID: 85028754690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-38424-3_32     Document Type: Conference Paper

References (22)

1. J. Alter. When, photographs lie. Newsweek, pp. 44-45, July 30, 1990.
2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, Nov. 1984.
3. G. Brassard and M. Yung. One-way group actions. In Advances in Cryptology-Crypto '90, these proceedings. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
4. I. Damgård. Collision-free hash functions and public-key signature schemes. In Advances in Cryptology-Eurocrypt '87, pp. 203-217. Lecture Notes in Computer Science, vol. 304, Springer-Verlag, Berlin, 1988.
5. I. Damgård. A design principle for hash functions. In. Advances in Cryptology-Crypto '89 (ed. G. Brassard), pp. 416-427. Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, 1990.
6. 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.
7. W. Diffie and M. E. Heilman. New directions in cryptography. IEEE Trans, on Inform. Theory, vol. IT-22, Nov. 1976, pp. 644-654.
8. Z. Galil, S. Haber, and M. Yung. Interactive public-key cryptosystems. Submitted for publication, 1990.
9. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28:270-299, April 1984.
10. S. Goldwasser, S. Micali, and R. Rivest. A secure digital signature scheme. SIAM Journal on Computing, 17(2):281-308, 1988.
11. Andy Grundberg. Ask it no questions: The camera can lie. The New York Times, section 2, pp. 1, 29, August 12, 1990.
12. R. Impagliazzo, L. Levin, and M. Luby. Pseudorandom generation from one-way functions. In Proc. 21st STOC, pp. 12-24. ACM, New York, 1989.
13. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. In Proc. 30th FOCS, pp. 230-235. IEEE, New York, 1989.
14. H. M. Kanare. Writing the laboratory notebook, p. 117. American Chemical Society, Washington, B. C., 1985.
15. R. C. Merkle. Secrecy, authentication, and publickey systems. Ph.D. thesis, Stanford Univeristy, 1979.
16. R. C. Merkle. One-way hash functions and DES. In Advances in Cryptology-Crypto '89 (ed. G. Brassard), pp. 428-446. Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, 1990.
17. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proc. 21st STOC, pp. 33-43. ACM, New York, 1989.
18. M. O. Rabin. Digitalized signatures. In Foundations of Secure Computation (ed. R. A. DeMillo et al.), pp. 155-168. Academic Press, 1978.
19. R. Rivest. The MD4 message digest algorithm. In Advances in Cryptology-Crypto '90, these proceedings. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
20. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd STOC, pp. 387-394. ACM, New York, 1990.
21. C. Shannon. Prediction and entropy of printed English. Bell System Technical Journal, vol. 30 pp. 50-64, 1951.
22. A. C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd FOCS, pp. 80-91. IEEE, New York, 1982.