{"created":"2025-01-19T01:45:25.411803+00:00","updated":"2025-03-06T05:57:57.845577+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240943","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"240943","title":["任意関数と対称関数に対するコインベースプロトコル"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"df5d8d59-1638-4d08-b621-8703d1c779f5"},"_deposit":{"id":"240943","pid":{"type":"depid","value":"240943","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"任意関数と対称関数に対するコインベースプロトコル","author_link":["662353","662354","662355","662356"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"任意関数と対称関数に対するコインベースプロトコル","subitem_title_language":"ja"},{"subitem_title":"Coin-Based Protocols for Any Function and Symmetric Function","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"物理暗号，秘密計算，コインベースプロトコル，任意関数，対称関数","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-10-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"茨城大学"},{"subitem_text_value":"茨城大学／産業技術総合研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Ibaraki Unibersity","subitem_text_language":"en"},{"subitem_text_value":"Ibaraki University / National Institute of Advanced Industrial Science and Technology ","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/240943/files/IPSJ-CSS2024197.pdf","label":"IPSJ-CSS2024197.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024197.pdf","filesize":[{"value":"287.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"30"},{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ca468420-03db-4545-957d-7ffa5ac62510","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"南川, 侑太"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"品川, 和雅"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuta, Minamikawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazumasa, Shinagawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"秘密計算とはデータを秘匿したまま計算することを可能にする技術である．Komano-Mizuki(TPNC2018) はコインを用いて秘密計算を行うプロトコルとしてコインベースプロトコルを提案した．その後，著者ら (SCIS2024) は任意の論理関数 f : {0, 1}^n → {0, 1} をコイン 2n + 7 枚で秘密計算するプロトコルを提案したが，そのプロトコル構成には誤りがあり，正しく動作しなかった．本稿では，そのプロトコルの修正版として，任意の論理関数に対する 2n + 9 枚のプロトコルを構成する．さらに，対称関数の場合には必要コイン枚数が 2n + 6 枚に削減できることも示す．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Secure computation is a technique that allows computation while keeping data secret. Komano-Mizuki(TPNC2018) proposed a coin-based protocol for secure computation using coins. Later, the authors(SCIS2024) proposed a coin-based protocol for secure computation of any boolean function f : {0, 1}^n →{0, 1} with 2n +7 coins, but the protocol had an error and did not work correctly. In this paper, we construct a modified version of that protocol for 2n + 9 coins for any functions. We also show that the number of coins required can be reduced to 2n + 6 for symmetric functions. ","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1488","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"1481","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":240943,"links":{}}