.png){kind=icon}
.png){kind=icon}
Return
How to Prove Work: With Time or Memory
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3138497.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, 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, 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.
Keywords:
Blockchain
moderate hard primitives
proof-of-work
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W