{"links":{},"id":240940,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240940","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"240940","title":["グラフの連結成分を数えるカードプロトコル"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"5065634b-c5fe-4af0-8f40-bae06b9f2bc8"},"_deposit":{"id":"240940","pid":{"type":"depid","value":"240940","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"グラフの連結成分を数えるカードプロトコル","author_link":["662339","662340"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グラフの連結成分を数えるカードプロトコル","subitem_title_language":"ja"},{"subitem_title":"Card-Based Protocol Counting Connected Components","subitem_title_language":"en"}]},"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":"九州大学／産業技術総合研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyushu University / 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/240940/files/IPSJ-CSS2024194.pdf","label":"IPSJ-CSS2024194.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024194.pdf","filesize":[{"value":"1.7 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":"4e579d33-d1b7-4f0b-9323-dffe2a37dd13","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":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koji, Nuida","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":"カードベース暗号の分野では，ペンシルパズルの解のゼロ知識証明との関連から，格子状の盤面におけるマス目集合の連結性や辺集合の連結性を確かめるカードプロトコルが近年研究されている．本論文ではその問題を一般化し，グラフの頂点集合の部分集合を秘匿しつつその部分集合の連結成分の個数を数えるカードプロトコルを提案する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the area of card-based cryptography, motivated by zero-knowledge proofs for solutions in pencil puzzles, there is a direction of recent studies on card-based protocols to verify connectivity of a set of cells or edges on lattice-shaped boards.  In this paper, we generalize the problem to counting connected components of subsets on any graph, and propose a card-based protocol for the problem.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1464","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"1457","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T01:45:25.131146+00:00","updated":"2025-03-06T05:57:47.011620+00:00"}