Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR04-049 | 15th June 2004 00:00

Optimal Trade-Off for Merkle Tree Traversal

RSS-Feed

Abstract:

We prove upper and lower bounds for computing Merkle tree
traversals, and display optimal trade-offs between time
and space complexity of that problem.



ISSN 1433-8092 | Imprint