Article

Almost optimal hash sequence traversal

Authors:

Don Coppersmith,

Markus JakobssonAuthors Info & Claims

FC'02: Proceedings of the 6th international conference on Financial cryptography

Pages 102 - 119

Published: 11 March 2002 Publication History

Abstract

We introduce a novel technique for computation of consecutive preimages of hash chains. Whereas traditional techniques have a memory-times-computation complexity of O(n) per output generated, the complexity of our technique is only O(log²n), where n is the length of the chain.

Our solution is based on the same principal amortization principle as [2], and has the same asymptotic behavior as this solution. However, our solution decreases the real complexity by approximately a factor of two. Thus, the computational costs of our solution are approximately 1/2log₂ n hash function applications, using only a little more than log₂ n storage cells.

A result of independent interest is the lower bounds we provide for the optimal (but to us unknown) solution to the problem we study. The bounds show that our proposed solution is very close to optimal. In particular, we show that there exists no improvement on our scheme that reduces the complexity by more than an approximate factor of two.

References

[1]

G. Itkis and L. Reyzin, "Forward-Secure Signatures with Optimal Signing and Verifying," Crypto '01, pp. 332-354.

Digital Library

Google Scholar

[2]

M. Jakobsson, "Fractal Hash Sequence Representation and Traversal," ISIT '02; full paper at www.markus-jakobsson.com.

Google Scholar

[3]

M. Jakobsson "Method and Apparatus for Efficient Computation of One-Way Chains in Cryptographic Applications," U.S. Patent Application 09/969, 833.

Google Scholar

[4]

L. Lamport, "Constructing Digital Signatures from a One Way Function," SRI International Technical Report CSL-98 (October 1979).

Google Scholar

[5]

R. Merkle, "A digital signature based on a conventional encryption function," Proceedings of Crypto '87.

Digital Library

Google Scholar

[6]

S. Micali, "Efficient Certificate Revocation," Proceedings of RSA '97, and U.S. Patent No. 5,666,416.

Google Scholar

[7]

A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and Secure Source Authentication for Multicast," Proceedings of Network and Distributed System Security Symposium NDSS 2001, February 2001.

Google Scholar

[8]

A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient Authentication and Signing of Multicast Streams over Lossy Channels," Proc. of IEEE Security and Privacy Symposium S & P 2000, May 2000.

Digital Library

Google Scholar

[9]

A. Perrig, R. Canetti, D. Song, and D. Tygar, "TESLA: Multicast Source Authentication Transform", Proposed IRTF draft, http://pziris.cs.berkeley.edu/~perrig/

Google Scholar

[10]

K. S. J. Pister, J. M. Kahn and B. E. Boser, "Smart Dust: Wireless Networks of Millimeter-Scale Sensor Nodes. Highlight Article in 1999 Electronics Research Laboratory Research Summary.", 1999. See http://robotics.eecs.berkeley.edu/~pister/SmartDust/

Google Scholar

[11]

FIPS PUB 180-1, "Secure Hash Standard, SHA-1," www.itl.nist.gov/fipspubs/fip180-1.htm

Google Scholar

[12]

S. Stubblebine and P. Syverson, "Fair On-line Auctions Without Special Trusted Parties," Financial Cryptography '01.

Digital Library

Google Scholar

Cited By

View all

Murvay PPopa LGroza B(2019)Accommodating Time-Triggered Authentication to FlexRay DemandsProceedings of the Third Central European Cybersecurity Conference10.1145/3360664.3360666(1-6)Online publication date: 14-Nov-2019
https://dl.acm.org/doi/10.1145/3360664.3360666
Compagno AZeng XMuscariello LCarofiglio GAugé JSchmidt TSeedorf J(2017)Secure producer mobility in information-centric networkProceedings of the 4th ACM Conference on Information-Centric Networking10.1145/3125719.3125725(163-169)Online publication date: 26-Sep-2017
https://dl.acm.org/doi/10.1145/3125719.3125725
Szalachowski PKim T(2015)Secure broadcast in distributed networks with strong adversariesSecurity and Communication Networks10.1002/sec.12968:18(3739-3750)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1002/sec.1296
Show More Cited By

Recommendations

Optimal trade-off for Merkle tree traversal

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 M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle ...
Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
CT-RSA '09: Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology

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 ⌈...
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents

We study the problem of deterministically exploring an undirected and initially unknown graph with n vertices either by a single agent equipped with a set of pebbles or by a set of collaborating agents. The vertices of the graph are unlabeled and cannot ...

Comments

Information & Contributors

Information

Published In

FC'02: Proceedings of the 6th international conference on Financial cryptography

March 2002

302 pages

ISBN:354000646X

Editor:
Matt Blaze
AT&T Labs-Research, Florham Park, NJ

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 March 2002

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
2
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Murvay PPopa LGroza B(2019)Accommodating Time-Triggered Authentication to FlexRay DemandsProceedings of the Third Central European Cybersecurity Conference10.1145/3360664.3360666(1-6)Online publication date: 14-Nov-2019
https://dl.acm.org/doi/10.1145/3360664.3360666
Compagno AZeng XMuscariello LCarofiglio GAugé JSchmidt TSeedorf J(2017)Secure producer mobility in information-centric networkProceedings of the 4th ACM Conference on Information-Centric Networking10.1145/3125719.3125725(163-169)Online publication date: 26-Sep-2017
https://dl.acm.org/doi/10.1145/3125719.3125725
Szalachowski PKim T(2015)Secure broadcast in distributed networks with strong adversariesSecurity and Communication Networks10.1002/sec.12968:18(3739-3750)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1002/sec.1296
Cairns KGamage THauser CSadeghi AGligor VYung M(2013)Efficient targeted key subset retrieval in fractal hash sequencesProceedings of the 2013 ACM SIGSAC conference on Computer & communications security10.1145/2508859.2516739(1273-1284)Online publication date: 4-Nov-2013
https://dl.acm.org/doi/10.1145/2508859.2516739
Dini GSavino I(2011)LARKACM Transactions on Embedded Computing Systems10.1145/2043662.204366510:4(1-35)Online publication date: 1-Nov-2011
https://dl.acm.org/doi/10.1145/2043662.2043665
Yum DKim JLee PHong S(2010)On fast verification of hash chainsProceedings of the 2010 international conference on Topics in Cryptology10.1007/978-3-642-11925-5_26(382-396)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-11925-5_26
Yum DSeo JEom SLee P(2009)Single-Layer Fractal Hash Chain Traversal with Almost Optimal ComplexityProceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology10.1007/978-3-642-00862-7_22(325-339)Online publication date: 29-Apr-2009
https://dl.acm.org/doi/10.1007/978-3-642-00862-7_22
Lucks SZenner EWeimerskirch AWesthoff D(2008)Concrete Security for Entity RecognitionProceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology10.1007/978-3-540-89754-5_13(158-171)Online publication date: 14-Dec-2008
https://dl.acm.org/doi/10.1007/978-3-540-89754-5_13
Pathan AHong C(2007)A secure energy-efficient routing protocol for WSNProceedings of the 5th international conference on Parallel and Distributed Processing and Applications10.5555/2395970.2396013(407-418)Online publication date: 29-Aug-2007
https://dl.acm.org/doi/10.5555/2395970.2396013
Pathan AHong C(2007)Securing sensor reports in wireless sensor networksProceedings of the 13th international Euro-Par conference on Parallel Processing10.5555/2391541.2391650(881-890)Online publication date: 28-Aug-2007
https://dl.acm.org/doi/10.5555/2391541.2391650
Show More Cited By

Abstract

References

Cited By

Recommendations

Optimal trade-off for Merkle tree traversal

Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations