Fractal hash sequence representation and traversal Export

@inproceedings{citeulike:4270309, abstract = {We introduce a novel amortization technique for computation of consecutive pre-images of hash chains, given knowledge of the seed. While all previously known techniques have a memory-times-computational complexity of O(n) per chain element, the complexity of our technique can be upper bounded at O(log² n), making it a useful primitive for low-cost applications such as authentication, signatures and micro-payments.}, author = {Jakobsson, M.}, booktitle = {Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on}, citeulike-article-id = {4270309}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ISIT.2002.1023709}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1023709}, doi = {10.1109/ISIT.2002.1023709}, journal = {Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on}, keywords = {hash, merkle}, pages = {437+}, posted-at = {2009-04-03 18:24:54}, priority = {2}, title = {Fractal hash sequence representation and traversal}, url = {http://dx.doi.org/10.1109/ISIT.2002.1023709}, year = {2002} }

TY - CONF ID - citeulike:4270309 L3 - citeulike-article-id:4270309 N2 - We introduce a novel amortization technique for computation of consecutive pre-images of hash chains, given knowledge of the seed. While all previously known techniques have a memory-times-computational complexity of O(n) per chain element, the complexity of our technique can be upper bounded at O(log² n), making it a useful primitive for low-cost applications such as authentication, signatures and micro-payments. JF - Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on TI - Fractal hash sequence representation and traversal T2 - Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on SP - 437 KW - hash KW - merkle AU - Jakobsson, M PY - 2002/// UR - http://dx.doi.org/10.1109/ISIT.2002.1023709 ER -