{"updated":"2025-03-06T06:12:47.790826+00:00","links":{},"created":"2025-01-19T01:45:31.768069+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241010","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"241010","title":["Mizuki--Kumamoto--SoneのANDプロトコルの最適性"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"8abf4e9a-3bc1-4570-86ef-26d7af0ee110"},"_deposit":{"id":"241010","pid":{"type":"depid","value":"241010","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Mizuki--Kumamoto--SoneのANDプロトコルの最適性","author_link":["662816","662817","662818","662819"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Mizuki--Kumamoto--SoneのANDプロトコルの最適性","subitem_title_language":"ja"},{"subitem_title":"Optimality of the Mizuki–Kumamoto–Sone’s AND Protocol","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"カードベース暗号，秘密計算，AND プロトコル，不可能性証明","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 University","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/241010/files/IPSJ-CSS2024264.pdf","label":"IPSJ-CSS2024264.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024264.pdf","filesize":[{"value":"653.1 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":"5b17eb18-29f1-4af9-8537-dc1bfe86e29d","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":"Shota, Ikeda","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":"Mizuki–Kumamoto–Sone の AND プロトコルは 4 枚非コミット型 AND プロトコルである．このプロトコルはランダム二等分割カット 1 回とランダムカット 1 回の合計 2 回の一様閉シャッフルを適用するものであり，カード枚数は明らかに最小であるが，一方でシャッフル回数の最適性については明らかではない．この 2 回のシャッフルは連続して適用されるため，理論的には 1 回のシャッフルにまとめることができるが，一様だが閉じていないシャッフルになってしまう．以上の背景のもとで，2023 年に水木は「一様閉シャッフル 1 回で 4 枚非コミット型 AND プロトコルが構成できるか？」という未解決問題を提出した．本稿では，一様閉シャッフル 1 回で 4 枚非コミット型 AND プロトコルが構成できないことを示す．これにより，Mizuki–Kumamoto–Sone の AND プロトコルが一様閉シャッフルを用いた 4 枚非コミット型 AND プロトコルとして，シャッフル回数が最小であることが示される．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The Mizuki-Kumamoto-Sone’s AND protocol is a four-card non-committed-format card-based AND protocol. This protocol uses two uniform closed shuffles: a random bisection cut and a random cut. While the number of cards is trivially optimal, but it is not clear whether the number of shuffles is optimal. Since these two shuffles are applied consecutively, they could theoretically be combined into a single shuffle, but it would result in a uniform but not closed shuffle. Against the above background, Mizuki proposed an open problem in 2023: “Can a four-card non-committed-format AND protocol be constructed with a single uniform closed shuffle?” This paper provides an impossibility proof that a four-card non-committed-format AND protocol can not be constructed with a single uniform closed shuffle. It is shown that the Mizuki–Kumamoto-Sone’s AND protocol has the minimum number of shuffles as a four-card non-committed-format AND protocol with uniform closed shuffles.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1979","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"1973","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":241010}