 |
 |
Conference papers
An (Almost) Constant-E ort Solution-Veri cation Proof-of-Work Protocol based on Merkle Trees
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
Cited literature [22 references]
https://hal-mines-paristech.archives-ouvertes.fr/hal-00752925
Contributor : Claire Medrala <>
Submitted on : Friday, November 16, 2012 - 4:25:52 PM
Last modification on : Thursday, September 24, 2020 - 4:36:01 PM
Long-term archiving on: : Saturday, December 17, 2016 - 12:09:46 PM
Contributor : Claire Medrala <>
Submitted on : Friday, November 16, 2012 - 4:25:52 PM
Last modification on : Thursday, September 24, 2020 - 4:36:01 PM
Long-term archiving on: : Saturday, December 17, 2016 - 12:09:46 PM
File
A-390.pdf
Files produced by the author(s)