Almost optimal hash sequence traversal

DOI10.1007/3-540-36504-4_8MaRDI QIDQ2995365zbMATH OpenOpenAlexFDO

Authors Don Coppersmith, Markus Jakobsson

Publication date 20 April 2011

Published in Financial Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36504-4_8

zbMATH Keywords

amortizationhash chainpebblesupper and lower bounds

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• On the computation-storage trade-offs of hash chain traversal
• Applied Cryptography and Network Security
• Topics in Cryptology – CT-RSA 2004
• Explicit optimal binary pebbling for one-way hash chain reversal

Cited in

(16)

• Efficient pebbling for list traversal synopses with application to program rollback
• The general pay-word: A micro-payment scheme based on n-dimension one-way hash chain
• scientific article; zbMATH DE number 1689608 (Why is no real title available?)
• Efficient Constructions for One-Way Hash Chains
• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• scientific article; zbMATH DE number 1962159 (Why is no real title available?)
• Binary pebbling algorithms for in-place reversal of one-way hash chains
• On fast verification of hash chains
• Advances in Cryptology - EUROCRYPT 2004
• Applied Cryptography and Network Security
• Concrete Security for Entity Recognition: The Jane Doe Protocol
• Explicit optimal binary pebbling for one-way hash chain reversal
• Coding and Cryptography
• On the computation-storage trade-offs of hash chain traversal
• Topics in Cryptology – CT-RSA 2004
• Optimal trade-off for Merkle tree traversal

This page was built for publication: Almost optimal hash sequence traversal

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