Sciweavers

Share
AFRICACRYPT
2008
Springer

An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees

9 years 12 days ago
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which 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.
Fabien Coelho
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where AFRICACRYPT
Authors Fabien Coelho
Comments (0)
books