Abstract
In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of Jakobsson, Leighton, Micali, and Szydlo (Jakobsson et al., 03) and Szydlo (Szydlo, 04). In particular, we show that our algorithm requires 2 logn/log(3) n hash function computations and storage for less than (logn/log(3) n + 1)loglogn + 2 logn hash values, where n is the number of leaves in the Merkle tree. We also prove that these trade-offs are optimal, i.e. there is no algorithm that requires less than O(logn/logt) time and less than O(tlogn/logt) space for any choice of parameter t ≥ 2.
Our algorithm could be of special use in the case when both time and space are limited.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coppersmith, D., Jakobsson, M.: Almost Optimal Hash Sequence Traversal. Financial Cryptography, 102–119 (2002)
Devanbu, P., Gertz, M., Martel, C., Stublebine, S.G.: Authentic Third Party Data Publication. In: 14th IFIP Workshop on Database Security (2000)
Jakobsson, M.: Fractal Hash Sequence Representation and Traversal. In: ISIT, p. 437 (2002)
Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle Tree Representation and Traversal. In: RSA Cryptographers Track, RSA Security Conference (2003)
Karpinski, M., Nekrich, Y.: A Note on Traversing Skew Merkle Trees, ECCC Report TR04-118
Lipmaa, H.: On Optimal Hash Tree Traversal for Optimal Time Stamping. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 357–371. Springer, Heidelberg (2002)
Merkle, R.: Secrecy, Authentication and Public Key Systems. UMI Research Press (1982)
Merkle, R.: A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)
Micali, S.: Efficient Certificate Revocation. Technical Report TM-542b, MIT Laboratory for Computer Science (March 22, 1996)
Micali, S., Rabin, M., Kilian, J.: Zero-Knowledge Sets. In: Proc. 44th FOCS, pp. 80–91 (2003)
Perrig, A., Canetti, R., Tygar, D., Song, D.: The TESLA Broadcast Authentication Protocol. Cryptobytes 5, 2–13
Rivest, R., Shamir, A.: PayWord and MicroMint - Two Simple Micropayment Schemes. CryptoBytes 1, 7–11
Szydlo, M.: Merkle Tree Traversal in Log Space and Time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 541–554. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P., Karpinski, M., Nekrich, Y. (2007). Optimal Trade-Off for Merkle Tree Traversal. In: Filipe, J., Coelhas, H., Saramago, M. (eds) E-business and Telecommunication Networks. ICETE 2005. Communications in Computer and Information Science, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75993-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-75993-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75992-8
Online ISBN: 978-3-540-75993-5
eBook Packages: Computer ScienceComputer Science (R0)