Optimal trade-off for Merkle tree traversal

DOI10.1016/j.tcs.2006.11.029zbMath1108.68047OpenAlexW2041190019MaRDI QIDQ870836

Yakov Nekrich, Piotr Berman, Marek Karpinski

Publication date: 15 March 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.029

zbMATH Keywords

optimalitytrade-offsamortizationauthentification pathMerkle tree traversalMerkle treestime and space complexity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Merkle Tree Traversal Revisited ⋮ Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

Cites Work

• Almost Optimal Hash Sequence Traversal
• Advances in Cryptology - EUROCRYPT 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal trade-off for Merkle tree traversal