Partial hash collision based postage scheme

| | TrackBacks (0)

HashCash
This along with the javascript hashing example is interesting because the client expends a small amount of effort to complete a transaction. Application to email and other resources is discussed.

Hash cash is payment in burnt CPU cycles by calculating n-bit partial hash collisions on chosen texts.

The idea of using partial hashes is that they can be made arbitrarily expensive to compute (by choosing the desired number of bits of collision), and yet can be verified instantly. This can be used as the basis for an ecash system measured in burnt CPU cycles. Such cash systems can be used to throttle systematic abuses of un-metered internet resources.

0 TrackBacks

Listed below are links to blogs that reference this entry: Partial hash collision based postage scheme.

TrackBack URL for this entry: http://kennethhunt.com/mt/mt-tb.cgi/651

About this Entry

This page contains a single entry by klsh published on February 22, 2003 1:25 PM.

JavaScript MD4, MD5 and SHA-1 Hash was the previous entry in this blog.

Gridlock Flash Game :: Rush Hour Clone is the next entry in this blog.

Find recent content on the main index or look in the archives to find all content.