{"created":"2025-01-19T01:15:15.764884+00:00","updated":"2025-01-19T16:37:47.854295+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214445","sets":["6164:6165:6462:10749"]},"path":["10749"],"owner":"44499","recid":"214445","title":["最小枚数の非コミット型６入力ANDプロトコルのシャッフル回数の改善"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-10-19"},"_buckets":{"deposit":"ec3acbe7-2434-48be-b781-d38402f520ba"},"_deposit":{"id":"214445","pid":{"type":"depid","value":"214445","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"最小枚数の非コミット型６入力ANDプロトコルのシャッフル回数の改善","author_link":["550642","550640","550641","550644","550643","550639"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最小枚数の非コミット型６入力ANDプロトコルのシャッフル回数の改善"},{"subitem_title":"Improvement on the Number of Shuffles for Card-Minimal Non-Committed Six-Input AND Protocol","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"カードベース暗号，秘密計算，カード組，非コミット型，論理積","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2021-10-19","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":"東北大学／産業技術総合研究所"},{"subitem_text_value":"東北大学／産業技術総合研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tohoku University","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University / National Institute of Advanced Industrial Science and Technology (AIST)","subitem_text_language":"en"},{"subitem_text_value":"Tohoku University / National Institute of Advanced Industrial Science and Technology (AIST)","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/214445/files/IPSJCSS2021045.pdf","label":"IPSJCSS2021045.pdf"},"date":[{"dateType":"Available","dateValue":"2023-10-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2021045.pdf","filesize":[{"value":"2.3 MB"}],"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":"a242b59b-4f6e-45ab-b9ff-17a78bff5639","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":[{}]},{"creatorNames":[{"creatorName":"水木, 敬明"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Raimu, Isuzugawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Daiki, Miyahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takaaki, Mizuki","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":"カードベース暗号では通常黒と赤の 2 枚のカードを用いて 1 ビットを表現するため，n 入力 AND 関数を 2n 枚で秘密計算するプロトコルは最小枚数の AND プロトコルと呼ばれる．本稿では，最小枚数の非コミット型 n 入力 AND プロトコルを扱い，特に必要なシャッフル回数に注目する．現状知られているシャッフル回数が少ないという意味で最良のプロトコルは，2 入力では 2012 年に Mizuki らが提案した 2 回のシャッフルのプロトコル，3 入力では 2021 年に佐々木らが提案した 2 回のシャッフルのプロトコル，4 入力以上では 2016 年に Mizuki が提案した n+1 回のシャッフルのプロトコルである．本稿では上述の佐々木らの 3 入力プロトコルを応用することで 12 枚のカードを用いた非コミット型 6 入力 AND プロトコルを新たに提案する．このプロトコルは最小枚数であり，シャッフル回数が 6.5 回（期待値）で実行でき，既存プロトコルから 0.5 回の削減に成功している．さらに 7 入力以上にプロトコルを拡張でき，シャッフル回数は n+0.5 回（期待値）であり，既存の n+1 回から削減している．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Because card-based cryptography usually encodes one bit using a pair of black and red cards, the protocols that perform secure computations of n-input AND functions with 2n cards are called card-minimal AND protocols. In this paper, we deal with card-minimal non-committed n-input AND protocols and focus on the number of shuffles. The best n-input AND protocols currently known use two shuffles for n=2, two shuffles for n=3, and n+1 shuffles for n>3. In this paper, we propose a new non-committed 6-input AND protocol with 12 cards by applying the existing 3-input protocol. This protocol is card-minimal and can be executed with expectation of 6.5 shuffles, which is 0.5 times less than the existing protocol. Furthermore, the protocol can be extended to 7 or more inputs, and the number of shuffles is n+0.5 in expectation, which is a reduction from n+1 shuffles the existing protocol requires.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"335","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2021論文集"}],"bibliographicPageStart":"328","bibliographicIssueDates":{"bibliographicIssueDate":"2021-10-19","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214445,"links":{}}