On optimal hash tree traversal for interval time-stamping

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

Volumn 2433, Issue , 2002, Pages 357-371

  Lipmaa, Helger ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Analysis of algorithms; Implementation complexity; Interval timestamping; Laplace s method for integrals; Tree traversal

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; LAPLACE TRANSFORMS; SECURITY OF DATA; STAMPING;

ANALYSIS OF ALGORITHMS; IMPLEMENTATION COMPLEXITY; S-METHOD; TIMESTAMPING; TREE TRAVERSAL;

TREES (MATHEMATICS);

EID: 84945264136     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45811-5_28     Document Type: Conference Paper

References (15)

1. Josh Benaloh and Michael de Mare. Efficient Broadcast Time-stamping. Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991.
2. Dave Bayer, Stuart A. Haber, and Wakefield Scott Stornetta. Improving the Efficiency And Reliability of Digital Time-stamping. In Sequences’91: Methods in Communication, Security, and Computer Science, pages 329-334. Springer-Verlag, 1992.
3. Ahto Buldas and Peeter Laud. New Linking Schemes for Digital Time-stamping. In The 1st International Conference on Information Security and Cryptology, pages 3–14, Seoul, Korea, 18–19 December 1998. Korea Institute of Information Security and Cryptology.
4. Ahto Buldas, Peeter Laud, Helger Lipmaa, and Jan Villemson. Time-stamping with Binary Linking Schemes. In Hugo Krawczyk, editor, Advances in Cryptology — CRYPTO’98, volume 1462 of Lecture Notes in Computer Science, pages 486–501, Santa Barbara, USA, 23–27 August 1998. International Association for Cryptologic Research, Springer-Verlag.
5. Ahto Buldas, Helger Lipmaa, and Berry Schoenmakers. Optimally Efficient Accountable Time-stamping. In Hideki Imai and Yuliang Zheng, editors, Public Key Cryptography’2000, volume 1751 of Lecture Notes in Computer Science, pages 293–305, Melbourne, Victoria, Australia, 18–20 January 2000. Springer-Verlag.
6. Ahto Buldas. Personal communication. June 2002.
7. Ivan Bjerre Damgård. Collision free hash functions and public key signature schemes. In David Chaum and Wyn L. Price, editors, Advances in Cryptology — EUROCRYPT’87, volume 304 of Lecture Notes in Computer Science, pages 203–216, Amsterdam, The Netherland s, 13–15 April 1987. Springer-Verlag, 1988.
8. Nicholas Govert de Bruijn. Asymptotic Methods in Analysis. Dover, January 1982.
9. StuartA. Haber and Wakefield Scott Stornetta. HowtoTime-stamp a Digital Document. Journal of Cryptology, 3(2):99–111, 1991.
10. Donald E. Knuth. The Art of Computer Programming. Volume 3: Sorting and Searching. Addison-Wesley, 2 edition, 1998.
11. Helger Lipmaa. Secure and Efficient Time-stamping Systems. PhD thesis, University of Tartu, June 1999.
12. Helger Lipmaa and Shiho Moriai. Efficient Algorithms for Computing Differential Properties of Addition. In Mitsuru Matsui, editor, Fast Software Encryption’2001, volume 2355 of Lecture Notes in Computer Science, pages 336–350, Yokohama, Japan, 2–4 April 2001. Springer-Verlag, 2002.
13. Ralph Charles Merkle. Protocols for Public Key Cryptosystems. In Proceedings of the 1980 Symposium on Security and Privacy, Oakland, California, USA, 14–16 April 1980. IEEE Computer Society Press.
14. Jan Willemson. Personal communication. July 2002.
15. Jan Willemson. Size-Efficient Interval Time Stamps. PhD thesis, University of Tartu, June 2002. Available from http://home.cyber.ee/jan/publ.html, May 2002.