WEKO3
アイテム
A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance
https://ipsj.ixsq.nii.ac.jp/records/215837
https://ipsj.ixsq.nii.ac.jp/records/215837dce955fb-51fa-4538-b99c-15369bad1833
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6301027.pdf (516.4 kB)
|
Copyright (c) 2022 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-01-15 | |||||||||
| タイトル | ||||||||||
| タイトル | A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文（推薦論文）] Bitcoin, Proof of Work, Hashcash, SHA-3, Preimage attack, Sponge Construction | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| University of Hyogo／Presently with University of Hyogo | ||||||||||
| 著者所属 | ||||||||||
| University of Hyogo／Presently with University of Hyogo | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| University of Hyogo / Presently with University of Hyogo | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| University of Hyogo / Presently with University of Hyogo | ||||||||||
| 著者名 |
Takaki, Asanuma
× Takaki, Asanuma
× Takanori, Isobe
|
|||||||||
| 著者名(英) |
Takaki, Asanuma
× Takaki, Asanuma
× Takanori, Isobe
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Hashcash, which is a Proof of Work (PoW) of bitcoin, is based on a preimage problem of hash functions of SHA-2 and RIPEMD. Since these hash functions employ the Merkle-Damgard (MD) construction, a preimage can be found with a negligible amount of memory. It is well known that such calculations can be speeded up by ASIC, and this causes a serious problem from the so-called 51% attack by dedicated ASIC mining pools. To address this issue, we propose a new PoW scheme based on a preimage problem of variants of SHA-3. Unlike SHA-2 and RIPEMD, SHA-3 adopts a sponge construction as an underlying domain extension algorithm. This difference allows us to make the problem of finding a preimage very memory-consuming calculations by properly choosing parameters of sponge functions. As a result, our scheme can achieve ASIC resistance by using SHA-3 for Hashcash. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.75 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Hashcash, which is a Proof of Work (PoW) of bitcoin, is based on a preimage problem of hash functions of SHA-2 and RIPEMD. Since these hash functions employ the Merkle-Damgard (MD) construction, a preimage can be found with a negligible amount of memory. It is well known that such calculations can be speeded up by ASIC, and this causes a serious problem from the so-called 51% attack by dedicated ASIC mining pools. To address this issue, we propose a new PoW scheme based on a preimage problem of variants of SHA-3. Unlike SHA-2 and RIPEMD, SHA-3 adopts a sponge construction as an underlying domain extension algorithm. This difference allows us to make the problem of finding a preimage very memory-consuming calculations by properly choosing parameters of sponge functions. As a result, our scheme can achieve ASIC resistance by using SHA-3 for Hashcash. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.75 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 63, 号 1, 発行日 2022-01-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
