{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00237161","sets":["1164:6389:11481:11662"]},"path":["11662"],"owner":"44499","recid":"237161","title":["3パターン出力のグラフアクセス構造を表現する2種スートカードプロトコル"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-07-15"},"_buckets":{"deposit":"3cb55ba3-dc8e-4163-a628-404d766bad12"},"_deposit":{"id":"237161","pid":{"type":"depid","value":"237161","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"3パターン出力のグラフアクセス構造を表現する2種スートカードプロトコル","author_link":["648657","648656"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"3パターン出力のグラフアクセス構造を表現する2種スートカードプロトコル"},{"subitem_title":"Two-suit card protocol representing a graph access structure with three output patterns","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"IPSJ-CSEC","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-07-15","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社インターネットイニシアティブ"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Internet Initiative Japan Inc.","subitem_text_language":"en"}]},"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/237161/files/IPSJ-SPT24056040.pdf","label":"IPSJ-SPT24056040.pdf"},"date":[{"dateType":"Available","dateValue":"2026-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SPT24056040.pdf","filesize":[{"value":"264.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":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"fd4af1a3-ac05-4c9b-8721-e6d55c076044","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"須賀, 祐治"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuji, Suga","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12628305","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-8671","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"2 者間非コミットメント型カードプロトコルにおいて，グラフをアクセス構造として取り扱うことを考える．与えられたグラフから 1 頂点を選択することをカード入力とし，入力を秘匿しつつグラフ上の 2 点間の関係を出力する秘密計算を考える．SCIS2024 にてカードプロトコルの系列で n-gon グラフ Cn のアクセス構造を持つカードプロトコルが提示されている．実装方法としてはカード入力時にランダムカットを用いた単純な新しい入力方法が導入されており，入力後はデッキ分割法を適用しパイルスクランブルシャッフルとランダムカットを一度に行う効率的な処理を行っている．本稿は 2 種類のスート[♡][♧黒} だけで構成される入力パターンの初期状態を分類し，この入力に応じて構成されるアクセス構造がグラフで表現されるかどうかについて検討を行う．グラフのノードの連結性に基づいて出力が異なるケースを基本とするが，特に 3 パターンを出力するケース，つまり同じ入力か，2 頂点が連結か否かで出力が異なるカードプロトコルについて考察を行う．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In a two-party non-committed card protocol, we consider treating a graph as an access structure. We explore a secret computation where the card input is used to select one vertex from a given graph, keeping the input secret while outputting the relationship between two points on the graph. At SCIS2024, a card protocol with an access structure for the n-gon graph Cn was presented in the series of card protocols. A novel input method using random cuts for input patterns was introduced. Post-input, the deck partition method is applied to simultaneously perform pile scramble shuffling and random cuts for efficient processing. In this paper, we classify the initial state of input patterns consisting of only two types of suits, [♡] and [♧black}, and examine whether the access structure constructed according to this input can be represented by a graph. We focus on cases where the output varies based on the adjacency of the vertices in the graph. Specifically, we consider a card protocol that produces three different output patterns, depending on whether the inputs are the same or whether the two vertices are connected.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告セキュリティ心理学とトラスト（SPT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"40","bibliographicVolumeNumber":"2024-SPT-56"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:39:38.129913+00:00","updated":"2025-01-19T08:58:28.808437+00:00","id":237161}