A space- and time-efficientImplementation of the Merkle TreeTraversal Algorithm

摘要

We have developed an algorithm for the Merkle tree traversal problem which combines the efficient space- time trade-off from the fractal Merkle-trees [4] and the space efficiency from the improved log space-time Merkle-trees traversal [8]. We further programmed a low storage space and a low time overhead version of the algorithm in Java and measured its performance with respect to two different implementations.