Abstract
Yaron Sella recently proposed a scalable version of Jakobsson’s algorithm to traverse a hash chain of size n. Given the hash chain and a computation limit m (k=m+1 and (b = \(\sqrt[k]{n}\))), Sella’s algorithm traverses the hash chain using a total of kb memory. We improve the memory usage to k(b–1). Because efficient hash chain traversal algorithms are aimed at devices with severely restricted computation and memory requirements, a reduction by a factor of (b–1)/b is considered to be important. Further, our algorithm matches the memory requirements of Jakobsson’s algorithm while still remaining scalable. Sella’s algorithm, when scaled to the case of Jakobsson’s algorithm, has a memory requirement of about twice that of Jakobsson’s.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Coppersmith, D., Jakobsson, M.: Almost optimal hash sequence traversal. In: Proc. of the Fifth Conference on Financial Cryptography (FC) 2002 (March 2002)
Haller, H.: The S/Key one-time password system. RFC 1760, Internet Engineering Taskforce (February 1995)
Itkis, G., Reyzin, L.: Forward-secure signature with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 332–354. Springer, Heidelberg (2001)
Jakobsson, M.: Fractal hash sequence representation and traversal. In: IEEE International Symposium on Information Theory (ISIT) 2002, Lausanne, Switzerland (2002)
Perrig, A., Canetti, R., Song, D., Tygar, D.: Efficient authentication and signing of multicast streams over lossy channels. In: Proc. of IEEE Security and Provacy Symposium, May 2000, pp. 56–73 (2000)
Perrig, A., Canetti, R., Song, D., Tygar, D.: TESLA: Multicast source authenticatio n transform, Proposed IRFT Draft, http://paris.cs.berkeley.edu/perrig/
Sella, Y.: On the computation-storage trade-offs of hash chain traversal. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 270–285. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SR. (2005). Scalable Hash Chain Traversal for Mobile Devices. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_38
Download citation
DOI: https://doi.org/10.1007/11424758_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25860-5
Online ISBN: 978-3-540-32043-2
eBook Packages: Computer ScienceComputer Science (R0)