{"created":"2025-01-19T01:34:37.844721+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233282","sets":["1164:3925:11477:11523"]},"path":["11523"],"owner":"44499","recid":"233282","title":["与えられたグラフでアクセス構造を表現する2種スートカードプロトコルにおける1ユーザの配布枚数が8枚までの完全分類"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-11"},"_buckets":{"deposit":"3894ddb5-7060-418a-b9f4-23e8b8f15e74"},"_deposit":{"id":"233282","pid":{"type":"depid","value":"233282","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"与えられたグラフでアクセス構造を表現する2種スートカードプロトコルにおける1ユーザの配布枚数が8枚までの完全分類","author_link":["633326","633325"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"与えられたグラフでアクセス構造を表現する2種スートカードプロトコルにおける1ユーザの配布枚数が8枚までの完全分類"},{"subitem_title":"Complete classification of up to 8 cards distributed to a single user in 2 types of suit card protocols that represent the access structure in a given graph","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"暗号2","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-03-11","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/233282/files/IPSJ-CSEC24104068.pdf","label":"IPSJ-CSEC24104068.pdf"},"date":[{"dateType":"Available","dateValue":"2026-03-11"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC24104068.pdf","filesize":[{"value":"290.8 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":"44"}],"accessrole":"open_date","version_id":"a4597e02-e24a-4714-8775-c8d8745e3c6f","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":"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":"2 者間非コミットメント型カードプロトコルにおいて，グラフをアクセス構造ととして取り扱う．与えられたグラフから 1 頂点を選択することを秘密の入力とし，入力を秘匿しつつ 2 点間の距離のみを出力する秘密計算を考える．SCIS2024 にてカードプロトコルの系列で n-gon グラフ Cn のアクセス構造を持つカードプロトコルが提示されている．実装方法としてはカード入力時にランダムカットを用いた単純な新しい入力方法が導入されており，入力後はデッキ分割法を適用しパイルスクランブルシャッフルとランダムカットを一度に行う効率的な処理を行っている．本稿は位数が 8 まで，つまり 1 ユーザの配布枚数が 3 から 8 枚までの状況において 2 種類のスート［ハート］［クローバー］だけで構成される入力パターンの初期状態を分類し，この入力に応じて構成されるアクセス構造がグラフで表現されるかどうかについて検討を行った．グラフの距離に基づいて出力が異なるケースを基本とし，この成約を少し緩めて与えられたグラフにおいて隣接しているかどうかだけを出力とするプロトコルの存在性についても議論した．後者のケースでは，相手の入力したノードと一致・隣接・それ以外，の3パターンを出力するカードプロトコルが構成できたことを示している．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In a two-party uncommitted card protocol, we treat the graph as an access structure. In SCIS2024, a family of card protocols with an n-gon graph Cn access structure is presented. The implementation introduces a simple new input method using random cut at card input phase, and after the input, the deck partitioning method is applied to efficiently perform pile scramble shuffling and random cut at a time. This paper classifies the initial state of input patterns consisting of only two suits [heart] and [clover] in situations where the number of cards distributed to a user is up to 8, i.e., from 3 to 8, and examines whether the access structure constructed in response to this input can be represented by a graph. The basic case is that the output differs based on the distance of the graph. We also discussed the existence of a protocol that relaxes this restriction a little and only considers whether or not a node is adjacent to another node in a given graph as its output. In the latter case, we showed that it is possible to construct a card protocol that outputs three patterns: matched, adjacent, or other than the node entered by the other party.","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":"2024-03-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"68","bibliographicVolumeNumber":"2024-CSEC-104"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":233282,"updated":"2025-01-19T10:08:53.976888+00:00","links":{}}