Almost optimal hash sequence traversal

DOI10.1007/3-540-36504-4_8zbMATH Open1275.94025OpenAlexW2138644571MaRDI QIDQ2995365FDOQ2995365

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

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

zbMATH Keywords

upper and lower boundsamortizationpebbleshash chain

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (16)

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

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)