On Optimal Hash Tree Traversal for Interval Time-Stamping

Helger Lipmaa. On Optimal Hash Tree Traversal for Interval Time-Stamping. In Agnes Hui Chan, Virgil D. Gligor, editors, Information Security, 5th International Conference, ISC 2002 Sao Paulo, Brazil, September 30 - October 2, 2002, Proceedings. Volume 2433 of Lecture Notes in Computer Science, pages 357-371, Springer, 2002. [doi]

@inproceedings{Lipmaa02a,
  title = {On Optimal Hash Tree Traversal for Interval Time-Stamping},
  author = {Helger Lipmaa},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2433/24330357.htm},
  tags = {traversal},
  researchr = {https://researchr.org/publication/Lipmaa02a},
  cites = {0},
  citedby = {0},
  pages = {357-371},
  booktitle = {Information Security, 5th International Conference, ISC 2002 Sao Paulo, Brazil, September 30 - October 2, 2002, Proceedings},
  editor = {Agnes Hui Chan and Virgil D. Gligor},
  volume = {2433},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44270-7},
}