An online algorithm for generating fractal hash chains applied to digital chains of custody

Computer Science – Cryptography and Security

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper gives an online algorithm for generating Jakobsson's fractal hash chains. Our new algorithm compliments Jakobsson's fractal hash chain algorithm for preimage traversal since his algorithm assumes the entire hash chain is precomputed and a particular list of Ceiling(log n) hash elements or pebbles are saved. Our online algorithm for hash chain traversal incrementally generates a hash chain of n hash elements without knowledge of n before it starts. For any n, our algorithm stores only the Ceiling(log n) pebbles which are precisely the inputs for Jakobsson's amortized hash chain preimage traversal algorithm. This compact representation is useful to generate, traverse, and store a number of large digital hash chains on a small and constrained device. We also give an application using both Jakobsson's and our new algorithm applied to digital chains of custody for validating dynamically changing forensics data.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An online algorithm for generating fractal hash chains applied to digital chains of custody does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An online algorithm for generating fractal hash chains applied to digital chains of custody, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An online algorithm for generating fractal hash chains applied to digital chains of custody will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-586255

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.