Bear writes:
I'm wondering how applicable RPOW is. Generally speaking, all
the practical applications I can think of for a proof-of-work
are defeated if proofs-of-work are storable, transferable, or
reusable. Once they're storable, tranferable, and reusable,
aren't we restricted to
*
DIMACS Workshop on Mobile and Wireless Security
November 3 - 4, 2004
DIMACS Center, Rutgers University, Piscataway, NJ
Organizers:
Bill Arbaugh, University of Maryland, [EMAIL PROTECTED]
Presented under
More on the question of HMAC. As mentioned before, the potential attack
would be to find a collision on the inner hash, even without knowing the
key. Since the key is exactly one hash block in length, the effect is
identical to finding a hash collision without knowing the IV.
Discussing this
I'm wondering how applicable RPOW is. Generally speaking, all
the practical applications I can think of for a proof-of-work
are defeated if proofs-of-work are storable, transferable, or
reusable.
I have some code to play online games with cryptographic protection,
cards and dice,
and I am
