EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...