Almost Optimal Hash Sequence Traversal

DOI10.1007/3-540-36504-4_8zbMath1275.94025OpenAlexW2138644571MaRDI QIDQ2995365

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

upper and lower boundshash chainamortizationpebbles

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Efficient pebbling for list traversal synopses with application to program rollback ⋮ Optimal trade-off for Merkle tree traversal ⋮ The general pay-word: A micro-payment scheme based on \(n\)-dimension one-way hash chain ⋮ Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity ⋮ Concrete Security for Entity Recognition: The Jane Doe Protocol

This page was built for publication: Almost Optimal Hash Sequence Traversal