Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Almost optimal hash sequence traversal
- Applied Cryptography and Network Security
- Efficient Constructions for One-Way Hash Chains
- scientific article; zbMATH DE number 1962159 (Why is no real title available?)
- scientific article; zbMATH DE number 1842500 (Why is no real title available?)
- scientific article; zbMATH DE number 2102685 (Why is no real title available?)
- On the computation-storage trade-offs of hash chain traversal
- Optimal trade-off for Merkle tree traversal
- Topics in Cryptology – CT-RSA 2004
Cited in
(10)- TARD: temporary access rights delegation for guest network devices
- Almost optimal hash sequence traversal
- scientific article; zbMATH DE number 1962159 (Why is no real title available?)
- scientific article; zbMATH DE number 2038764 (Why is no real title available?)
- Binary pebbling algorithms for in-place reversal of one-way hash chains
- On fast verification of hash chains
- Applied Cryptography and Network Security
- Explicit optimal binary pebbling for one-way hash chain reversal
- On the computation-storage trade-offs of hash chain traversal
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623056)