Almost Optimal Hash Sequence Traversal

Almost Optimal Hash Sequence Traversal (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Don Coppersmith , Markus Jakobsson

Citations:

59 - 7 self

BibTeX

@INPROCEEDINGS{Coppersmith02almostoptimal,
    author = {Don Coppersmith and Markus Jakobsson},
    title = {Almost Optimal Hash Sequence Traversal},
    booktitle = {},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

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 2 n), where n is the length of the chain.

Citations

183	A digital signature based on a conventional encryption function - Merkle - 1987
171	Efficient and secure source authentication for multicast - Perrig, Canetti, et al. - 2001
83	Efficient certificate revocation - Micali - 1996
60	Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin - 2001
52	Smart Dust: Wireless networks of milli-meter scale sensor nodes”, Electronics Research Laboratory Research Summary - Pister, Kahn, et al. - 1999
36	Fractal hash sequence representation and traversal - Jakobsson - 2002
34	Constructing digital signatures from a one way function - Lamport - 1979
29	TESLA: Multicast Source Authentication Transform. Work in progress. Internet Engineering Task Force - Perrig, Canetti, et al. - 2005
27	Fair on-line auctions without special trusted parties - Stubblebine, Syverson - 1999
4	E#cient Authentication and Signing of Multicast Streams over Lossy Channels - Perrig, Canetti, et al. - 2000