Don Coppersmith and Markus Jakobsson IBM T.J. Watson Research Center,...  Home/Search
Context Related
| indiana.edu/markus/papers/AOhash.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: tcs.hut.fi/~helger/crypto/link... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
Ecient Constructions for One-way Hash Chains Yih-Chun Hu - Markus Jakobsson And (Correct)
Tamper-Evident Digital Signatures: - Protecting Certification Authorities (Correct)
Securing Quality-of-Service Route Discovery in - On-Demand Routing For (Correct)
Active bibliography (related documents): More All
1.1: Almost Optimal Hash Sequence Traversal - Don Coppersmith And (2002) (Correct)
0.3: Fractal Merkle Tree Representation and Traversal - Jakobsson, Leighton, Micali.. (2003) (Correct)
0.2: Compositional Verification of Integrity for.. - Gorrieri.. (2003) (Correct)
Related documents from co-citation: More All
10: SPINS: Security protocols for sensor networks - Perrig, Szewczyk et al. - 2001
10: Fractal Hash Sequence Representation and Traversal - Jakobsson - 2002
7: SKEY one time password system - The, time et al. - 1994
BibTeX entry: (Update)
Don Coppersmith and Markus Jakobsson. Almost Optimal Hash Sequence Traversal. In Proceedings of the Fifth Conference on Financial Cryptography (FC '02), February 2002. http://citeseer.ist.psu.edu/coppersmith02almost.html More
@misc{ coppersmith02almost,
author = "D. Coppersmith and M. Jakobsson",
title = "Almost Optimal Hash Sequence Traversal",
text = "Don Coppersmith and Markus Jakobsson. Almost Optimal Hash Sequence Traversal.
In Proceedings of the Fifth Conference on Financial Cryptography (FC '02),
February 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/coppersmith02almost.html" }
Citations (may not include all citations):100 A digital signature based on a conventional encryption funct.. (context) - Merkle
72 Constructing Digital Signatures from a One Way Function (context) - Lamport - 1979
46 Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin
42 Smart Dust: Wireless Networks of Millimeter-Scale Sensor Nod.. (context) - Pister, Kahn et al. - 1999
30 Fair On-line Auctions Without Special Trusted Parties - Stubblebine, Syverson
10 anetti, D. Song, and D. Tygar, "E#cient and Secure Source Au.. (context) - Perrig - 2001
9 anetti, D. Song, and D. Tygar, "E#cient Authentication and S.. (context) - Perrig - 2000
3 E#cient Certificate Revocation (context) - Micali
2 Method and Apparatus for E#cient Computation of One-Way Chai.. (context) - Jakobsson
http://paris.cs.berkeley.edu/
www.itl.nist.gov/fipspubs/fip180-1.htm
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.tcs.hut.fi/~helger/crypto/link/data_structures/): More
Persistent Authenticated Dictionaries and Their.. - Anagnostopoulos.. (2001) (Correct)
Dynamic Accumulators and Application to Efficient.. - Camenisch, Lyasyanskaya (2002) (Correct)
Authentication of Embedded Data in HTML Documents through the Use .. - Straub (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC