@techreport{4459fef34f234d77939d85a3f8fcfec7,
title = "On Optimal Hash Tree Traversal for Interval Time-Stamping",
keywords = "analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal, analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal, analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal",
author = "Helger Lipmaa",
year = "2002",
language = "English",
series = "Cryptology ePrint archive",
publisher = "International Association for Cryptologic Research",
number = "2002/124",
type = "WorkingPaper",
institution = "International Association for Cryptologic Research",
}