Fractal Merkle Tree Representation and Traversal

We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 log N/loglog N hash function evaluations per output,

• Type: Conference
• Year: 2003
• Where: CTRSA
• Authors: Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo
• Keywords: Associated Authentication Paths, Cryptology, CTRSA 2003, Hash Function Evaluations, Worst-case Computational Effort