@article{oai:ipsj.ixsq.nii.ac.jp:00215837,
 author = {Takaki, Asanuma and Takanori, Isobe and Takaki, Asanuma and Takanori, Isobe},
 issue = {1},
 journal = {情報処理学会論文誌},
 month = {Jan},
 note = {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
------------------------------, 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
------------------------------},
 title = {A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance},
 volume = {63},
 year = {2022}
}