How to Prove Work: With Time or Memory

カテゴリ: 部門大会

論文No: OS1-13

グループ名: 【C】2022年電気学会電子・情報・システム部門大会

発行日: 2022/08/24

タイトル(英語): How to Prove Work: With Time or Memory

著者名: 蘇 翔宇（東京工業大学）,Larangeira Mario（IOHK, 東京工業大学）,田中 圭介（東京工業大学）

著者名(英語): Xiangyu Su (Tokyo Institute of Technology),Mario Larangeira (IOHK, Tokyo Institute of Technology),Keisuke Tanaka (Tokyo Institute of Technology)

キーワード: ブロックチェーン|プルーフオブワーク|時間|記憶領域|Blockchain|Proof of Work|Time|Memory

要約(日本語): Proof-of-work is attracting more attention with the cryptocurrency and blockchain technologies. 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 which is not generally accessible. Under a trusted setting, we propose a framework and its constructions based on computationally hard problems and the unified definition of hard cryptographic primitives in the previous work.