Cryptology ePrint Archive: Report 2002/124
On Optimal Hash Tree Traversal for Interval Time-Stamping
Abstract: Skewed trees constitute a two-parameter family of recursively constructed trees. Recently, Willemson proved that suitably picked skewed trees are space-optimal for interval time-stamping. At the same time, Willemson proposed a practical but suboptimal algorithm for nonrecursive traversal of skewed trees. We describe an alternative, extremely efficient traversal algorithm for skewed trees. The new algorithm is surprisingly simple and arguably close to optimal in every imaginable sense. We provide a detailed analysis of the average-case storage (and communication) complexity of our algorithm, by using the Laplace's method for estimating the asymptotic behavior of integrals. Since the skewed trees can be seen as a natural generalization of Fibonacci trees, our results might also be interesting in other fields of computer science.
Category / Keywords: cryptographic protocols / analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal
Publication Info: Accepted to ISC 2002.
Date: received 21 Aug 2002
Contact author: helger at tcs hut fi
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: More information available at http://www.tcs.hut.fi/~helger/papers/lip02a/.
Version: 20020822:135530 (All versions of this report)
Short URL: ia.cr/2002/124
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]