Forward-Secure Signatures with Optimal Signing and Verifying
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
PayWord and MicroMint: Two Simple Micropayment Schemes
Proceedings of the International Workshop on Security Protocols
NetCard - A Practical Electronic-Cash System
Proceedings of the International Workshop on Security Protocols
Fair On-Line Auctions without Special Trusted Parties
FC '99 Proceedings of the Third International Conference on Financial Cryptography
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient constructions for one-way hash chains
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Short Hash-Based Signatures for Wireless Sensor Networks
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
On fast verification of hash chains
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Efficient targeted key subset retrieval in fractal hash sequences
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We study the problem of traversing a hash chain with dynamic helper points (called pebbles). Basically, two kinds of algorithms for this problem are known to date. Jakobsson algorithm is a single-layer fractal algorithm with the computational cost of ⌈logn ⌉ (hash evaluations per chain link) and ⌈logn ⌉ pebbles. Coppersmith-Jakobsson algorithm is a complicated double-layer fractal algorithm that improves efficiency at the expense of simplicity; with a complex movement pattern and some extra pebbles, it reduces the computational cost by half. Specifically, Coppersmith-Jakobsson algorithm requires $\lfloor \frac{1}{2}\log n \rfloor$ hash evaluations per chain link and ⌈logn ⌉ + ⌈log(logn + 1) ⌉ pebbles, which attains an almost optimal complexity. We introduce a new hash chain traversal algorithm that achieves both simplicity and efficiency. While our algorithm is based on the simple single-layer fractal structure of the Jakobsson algorithm, it reduces the computational cost by half without using extra pebbles; specifically, $\lceil \frac{1}{2}\log n \rceil$ hash evaluations per chain link and ⌈logn ⌉ pebbles are needed.