Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > AUTHENTIFICATION PATH:
Reports tagged with Authentification Path:
TR04-049 | 15th June 2004
Piotr Berman, Marek Karpinski, Yakov Nekrich

Optimal Trade-Off for Merkle Tree Traversal

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

more >>>



ISSN 1433-8092 | Imprint