Name
Abstract | ||
|---|---|---|
Client puzzles have been proposed as a mechanism for proving legitimate intentions by providing \"proofs of work\", which can be applied to discourage malicious usage of resources. A typical problem of puzzle constructions is the difference in expected solving time on different computing platforms. We call puzzles which can be solved independently of client computing resources fair client puzzles. We propose a construction for client puzzles requiring widely distributed computational effort for their solution. These puzzles can be solved using the mining process of Bitcoin, or similar cryptocurrencies. Adapting existing definitions, we show that our puzzle construction satisfies formal requirements of client puzzles under reasonable assumptions. We describe a way of transforming our client puzzles for use in denial of service scenarios and demonstrate a practical construction. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-40253-6_10 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
Bitcoin, Client puzzles, Denial of service resistance, Distributed computation, Proofs of work | Conference | 2016 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
28 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin Boyd | 1 | 288 | 32.14 |
| Christopher Carr | 2 | 3 | 1.09 |