{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00215837","sets":["581:10784:10785"]},"path":["10785"],"owner":"44499","recid":"215837","title":["A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance "],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-01-15"},"_buckets":{"deposit":"f4c5d231-4e1e-467e-a844-b46e7de0137c"},"_deposit":{"id":"215837","pid":{"type":"depid","value":"215837","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance ","author_link":["556117","556118","556120","556119"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance "},{"subitem_title":"A Proof of Work based on Preimage Problem of Variants of SHA-3 with ASIC Resistance ","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文（推薦論文）] Bitcoin, Proof of Work, Hashcash, SHA-3, Preimage attack, Sponge Construction","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2022-01-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"University of Hyogo／Presently with University of Hyogo"},{"subitem_text_value":"University of Hyogo／Presently with University of Hyogo"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"University of Hyogo / Presently with University of Hyogo","subitem_text_language":"en"},{"subitem_text_value":"University of Hyogo / Presently with University of Hyogo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/215837/files/IPSJ-JNL6301027.pdf","label":"IPSJ-JNL6301027.pdf"},"date":[{"dateType":"Available","dateValue":"2024-01-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6301027.pdf","filesize":[{"value":"516.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ab64f7b2-8260-4b42-9564-3266d3772a7e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takaki, Asanuma"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takanori, Isobe"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takaki, Asanuma","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takanori, Isobe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.30.75\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.30(2022) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.30.75\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2022-01-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"63"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":215837,"updated":"2025-01-19T16:00:39.356367+00:00","links":{},"created":"2025-01-19T01:16:34.659866+00:00"}