Abstract
We study the problem of traversing a hash chain with a constant bound, m, on the number of hash-function evaluations allowed per each exposed link in the chain. We present a new, general protocol that solves this problem, and prove that its storage requirements are \(k\sqrt[k]{n}\) chain links, where k = m + 1. We propose a new, natural criterion for evaluating the utility of a hash chain traversal protocol, which measures the length of the hash chain that the protocol traverses under fixed storage constraints. We present a new, specific protocol, tailored for the case m = 1, which improves the performance of the general protocol (with respect to the above criterion) by more than twice, and prove that the specific protocol is optimal in that sense.
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
Anderson, R., Manifavas, C., Sutherland, C.: NetCard – A Practical Electronic Cash System. In: Proc. of the fourth Cambridge Security Protocols Workshop, Cambridge, UK, pp. 49–57 (1996)
Coppersmith, D., Jakobsson, M.: Almost Optimal Hash Sequence Traversal. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357. Springer, Heidelberg (2003)
Gennaro, R., Rohatgi, P.: How to sign digital streams. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 180–197. Springer, Heidelberg (1997)
Haller, N.: The S/KEY one-time password system. RFC 1760, Internet Engineering Task Force (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)
Kozlov, A., Reyzin, L.: Forward-Secure Signatures with Fast Key Update. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 241–256. Springer, Heidelberg (2003)
Lamport, L.: Constructing Digital Signatures from a One-way Function. SRI International Technical Report SRI-CSL-98 (October 1979)
Perrig, A., Canetti, R., Song, D., Tygar, D.: Efficient Authentication and Signing of Multicast Streams over Lossy Channels. In: Proc. of IEEE Security and Privacy Symposium, pp. 56–73 (May 2000)
Rivest, R.L., Shamir, A.: PayWord and MicroMint: Two Simple Micropayment Schemes. In: Proc. of The Fourth Cambridge Security Protocols Workshop, Cambridge, UK, pp. 69– 87 (1996)
Stubblebine, S., Syverson, P.: Fair On-line Auctions without Special Trusted Parties. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, p. 230. Springer, Heidelberg (1999)
FIPS PUB 180-1, Secure Hash Standard, SHA-1, http://www.itl.nist.gov/fipspubs/fip180-1.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sella, Y. (2003). On The Computation-Storage Trade-Offs of Hash Chain Traversal. In: Wright, R.N. (eds) Financial Cryptography. FC 2003. Lecture Notes in Computer Science, vol 2742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-45126-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40663-1
Online ISBN: 978-3-540-45126-6
eBook Packages: Springer Book Archive