Optimal trade-off for Merkle tree traversal

DOI10.1016/J.TCS.2006.11.029MaRDI QIDQ870836zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Marek Karpinski, Yakov Nekrich

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)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1962159
• Merkle Tree Traversal Revisited
• Almost optimal hash sequence traversal
• On the computation-storage trade-offs of hash chain traversal

Cites work

• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 1941252 (Why is no real title available?)
• scientific article; zbMATH DE number 1962159 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Almost optimal hash sequence traversal
• Authentic third-party data publication

Cited in

(5)

• scientific article; zbMATH DE number 1941252 (Why is no real title available?)
• scientific article; zbMATH DE number 1962159 (Why is no real title available?)
• Merkle Tree Traversal Revisited
• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• Advances in Cryptology - EUROCRYPT 2004

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870836)