{"created":"2025-06-23T08:45:46.021177+00:00","updated":"2025-06-23T08:45:49.794260+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02002869","sets":["1164:3925:11908:1749690073967"]},"path":["1749690073967"],"owner":"80578","recid":"2002869","title":["ポリオミノパズルに対するカードを用いたゼロ知識証明プロトコルの改良"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-06-30"},"_buckets":{"deposit":"2b90d41c-2103-4d5d-923a-999bca6ae342"},"_deposit":{"id":"2002869","pid":{"type":"depid","value":"2002869","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"ポリオミノパズルに対するカードを用いたゼロ知識証明プロトコルの改良","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ポリオミノパズルに対するカードを用いたゼロ知識証明プロトコルの改良","subitem_title_language":"ja"},{"subitem_title":"An Improvement on Card-Based Zero-Knowledge Proof Protocol for Polyomino Puzzles","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"CSEC","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2025-06-30","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"一関工業高等専門学校未来創造工学科情報・ソフトウェア系"},{"subitem_text_value":"福島工業高等専門学校電気電子システム工学科"},{"subitem_text_value":"一関工業高等専門学校未来創造工学科情報・ソフトウェア系"},{"subitem_text_value":"東北大学サイバーサイエンスセンター"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/2002869/files/IPSJ-CSEC25110035.pdf","label":"IPSJ-CSEC25110035.pdf"},"date":[{"dateType":"Available","dateValue":"2027-06-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC25110035.pdf","filesize":[{"value":"1.4 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":"44"}],"accessrole":"open_date","version_id":"f10c131f-5015-4907-bc57-ef805e896e8f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"室,大地"}]},{"creatorNames":[{"creatorName":"小泉,康一"}]},{"creatorNames":[{"creatorName":"千田,栄幸"}]},{"creatorNames":[{"creatorName":"水木,敬明"}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Daichi Muro","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Koichi Koizumi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Eikoh Chida","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Takaaki Mizuki","creatorNameLang":"en"}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8655","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ポリオミノパズルは，同じ大きさの正方形を辺同士で繋げた平面図形のピースを，互いに重ならないように与えられた枠内に収めるパズルである．また，ゼロ知識証明とは，ある問題の解を知っている証明者が，解を知らない検証者に自分が解を知っているという事実のみを納得させる暗号技術である．通常はコンピュータ上で実行されるが，物理的カードを用いたゼロ知識証明プロトコルも考案されており, 視覚的・直感的な理解が可能であるという利点がある. 柴宮らは電子情報通信学会2025年総合大会において，カードを用いたポリオミノパズルのゼロ知識証明プロトコルを与えた．これはk個のピースとn×m(m＞n)マスの枠に対して，(k-1)mn＋(m＋1)2＋2m2枚のカードと，2＋6k回のシャッフルを必要とする．本稿では，このゼロ知識証明プロトコルをベースとして改良を行い，カード枚数およびシャッフル回数を削減する新たなプロトコルを提案する．その性能は，使用カード枚数が(k-1)mn＋(m＋1)2＋mn枚，シャッフル回数は2＋4k回である．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2025-06-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"35","bibliographicVolumeNumber":"2025-CSEC-110"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"id":2002869,"links":{}}