Welcome to the resource topic for 2007/433
Title:
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees
Authors: Fabien Coelho
Abstract:Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions that are easy to check by the provider. We present such a new scheme for solution-verification protocols. Although most schemes to date are probabilistic unbounded iterative processes with high variance of the requester effort, our Merkle tree scheme is deterministic, with an almost constant effort and null variance, and is computation-optimal.
ePrint: https://eprint.iacr.org/2007/433
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .