CryptoDB
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2007-13713, title={An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol based on Merkle Trees}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / proof-of-work solution-verification protocol Merkle-tree}, url={http://eprint.iacr.org/2007/433}, note={Technical Report A/390/CRI, ?cole des mines de Paris iacr.org@coelho.net 13842 received 22 Nov 2007, last revised 25 Nov 2007}, author={Fabien Coelho}, year=2007 }