How to Prove Work: With Time or Memory
| Autor: | Keisuke Tanaka, Mario Larangeira, Xiangyu Su |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Scheme (programming language)
Cryptocurrency Theoretical computer science Cryptographic primitive General Computer Science business.industry Computer science Hash function General Engineering Cryptography Energy consumption Gas meter prover proof-of-work TK1-9971 TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Blockchain moderate hard primitives Proof-of-work system General Materials Science Electrical engineering. Electronics. Nuclear engineering business computer computer.programming_language |
| Zdroj: | IEEE ICBC IEEE Access, Vol 10, Pp 1192-1201 (2022) |
| DOI: | 10.1109/icbc51069.2021.9461131 |
| Popis: | Proposed by Dwork and Naor (Crypto’ 92) as an anti-spam technique, proof-of-work is attracting more attention with the boom of cryptocurrencies. A proof-of-work scheme involves two types of participants, $\textit {i.e.}$ , provers and verifiers. Provers are asked to solve a computational puzzle, and verifiers need to check the solution’s correctness. A widely adopted hash-based construction achieves an optimal gap in computational complexity between provers and verifiers. However, in industry, proof-of-work is done by highly dedicated hardware, $\textit {e.g.}$ , “ASIC”, which is not generally accessible, let alone the high energy consumption rates. In this work, we turn our eyes back to the original meaning of “proof of work”. Under a trusted setting, we propose a framework and its constructions based on computationally hard problems and the unified definition of hard cryptographic primitives by Biryukov and Perrin (Asiacrypt’ 17). The new framework enables us to have a proof-of-work scheme with time-hardness or memory-hardness while cutting down power consumption and reducing the impact of dedicated hardware. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|